Pavol Hell

Jephian C.-H. Lin

SIAM J. Discret. Math., March, 2024

Trees with minimum weighted Szeged index.

[BibT_eX]

[DOI]

Seyyed Aliasghar Hosseini

Art Discret. Appl. Math., 2024

Bi-arc Digraphs: Recognition Algorithm and Applications.

[BibT_eX]

[DOI]

Akbar Rafiey

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

List homomorphism problems for signed trees.

[BibT_eX]

[DOI]

Discret. Math., 2023

Describing hereditary properties by forbidden circular orderings.

[BibT_eX]

[DOI]

Santiago Guzmán-Pro

Appl. Math. Comput., 2023

2022

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

List Homomorphisms to Separable Signed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Strong Chordality of Graphs with Possible Loops.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Distance-two colourings of Barnette graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

In praise of homomorphisms.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2021

On the Kernel and Related Problems in Interval Digraphs.

[BibT_eX]

[DOI]

Dalu Jacob

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Template-Driven Rainbow Coloring of Proper Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Min-Orderable Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Bipartite Analogues of Comparability and Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Complexity of correspondence H-colourings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

List Homomorphism Problems for Signed Graphs.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Partitioning Cographs into Two Forests and One Independent Set.

[BibT_eX]

[DOI]

Anurag Sanyal

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Minimal obstructions to 2-polar cographs.

[BibT_eX]

[DOI]

Sebastián González Hermosillo de la Maza

Cláudia Linhares Sales

Discret. Appl. Math., 2019

Strongly chordal digraphs and Γ-free matrices.

[BibT_eX]

[DOI]

CoRR, 2019

Vertex arboricity of cographs.

[BibT_eX]

[DOI]

Seyyed Aliasghar Hosseini

Payam Valadkhan

CoRR, 2019

Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Distance-Two Colorings of Barnette Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Interval-Like Graphs and Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Distance-Two Coloring of Barnette Graphs.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Correspondence Homomorphisms to Reflexive Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Colourings, homomorphisms, and partitions of transitive digraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

The complexity of signed graph and edge-coloured graph homomorphisms.

[BibT_eX]

[DOI]

Discret. Math., 2017

Strict chordal and strict split digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

The complexity of tropical graph homomorphisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Ferrers dimension of grid intersection graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Complexity of Correspondence Homomorphisms.

[BibT_eX]

[DOI]

CoRR, 2017

Hamiltonian Cycles in Covering Graphs of Trees.

[BibT_eX]

[DOI]

Hiroshi Nishiyama

Ladislav Stacho

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Bi-Arc Digraphs and Conservative Polymorphisms.

[BibT_eX]

[DOI]

CoRR, 2016

Minimum Cost Homomorphisms with Constrained Costs.

[BibT_eX]

[DOI]

Mayssam Mohammadi Nevisi

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Preface.

[BibT_eX]

[DOI]

Qian-Ping Gu

Boting Yang

Theor. Comput. Sci., 2015

Join colourings of chordal graphs.

[BibT_eX]

[DOI]

Pei-Lan Yen

Discret. Math., 2015

Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms.

[BibT_eX]

[DOI]

Discret. Math., 2015

The complexity of signed graph and 2-edge-coloured graph homomorphisms.

[BibT_eX]

[DOI]

CoRR, 2015

Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014

H-coloring degree-bounded (acyclic) digraphs.

[BibT_eX]

[DOI]

Aurosish Mishra

Theor. Comput. Sci., 2014

Blocking Quadruple: A New Obstruction to Circular-Arc Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Graphs Admitting k-NU Operations. Part 2: The Irreflexive Case.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Semilattice polymorphisms and chordal graphs.

[BibT_eX]

[DOI]

Mark H. Siggers

Eur. J. Comb., 2014

Connected obstructions to full graph homomorphisms.

[BibT_eX]

[DOI]

Ales Pultr

Eur. J. Comb., 2014

Graph partitions with prescribed patterns.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

On the complexity of the 3-kernel problem in some classes of digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

A simple combinatorial interpretation of certain generalized Bell and Stirling numbers.

[BibT_eX]

[DOI]

Pietro Codara

Ottavio M. D'Antona

Discret. Math., 2014

Matrix partitions of split graphs.

[BibT_eX]

[DOI]

Oren Shklarsky

Discret. Appl. Math., 2014

Intersection Dimension of Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Space complexity of list H-colouring: a dichotomy.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Complexity of Coloring Graphs without Paths and Cycles.

[BibT_eX]

[DOI]

Shenwei Huang

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Ordering without Forbidden Patterns.

[BibT_eX]

[DOI]

Bojan Mohar

Proceedings of the Algorithms - ESA 2014, 2014

2013

Graphs Admitting k-NU Operations. Part 1: The Reflexive Case.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Obstructions to chordal circular-arc graphs of small independence number.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Obstructions to partitions of chordal graphs.

[BibT_eX]

[DOI]

Shekoofeh Nekooei Rizi

Discret. Math., 2013

Space complexity of list H-colouring: a dichotomy.

[BibT_eX]

[DOI]

CoRR, 2013

Recognition and Characterization of Chronological Interval Digraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Influence Diffusion in Social Networks under Time Window Constraints.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2013

Small H-Coloring Problems for Bounded Degree Digraphs.

[BibT_eX]

[DOI]

Aurosish Mishra

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Monotone Proper Interval Digraphs and Min-Max Orderings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Preface.

[BibT_eX]

[DOI]

Wilfried Imrich

Discret. Math., 2012

On edge-sets of bicliques in graphs.

[BibT_eX]

[DOI]

Marina Groshaus

Discret. Appl. Math., 2012

Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Small H-coloring problems for bounded degree digraphs

[BibT_eX]

[DOI]

Aurosish Mishra

CoRR, 2012

Counting Partitions of Graphs.

[BibT_eX]

[DOI]

Miki Hermann

Mayssam Mohammadi Nevisi

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Approximation of Minimum Cost Homomorphisms.

[BibT_eX]

[DOI]

Monaldo Mastrolilli

Mayssam Mohammadi Nevisi

Proceedings of the Algorithms - ESA 2012, 2012

2011

Partitioning Chordal Graphs.

[BibT_eX]

[DOI]

Shekoofeh Nekooei Rizi

Electron. Notes Discret. Math., 2011

Messy broadcasting - Decentralized broadcast schemes with limited knowledge.

[BibT_eX]

[DOI]

Hovhannes A. Harutyunyan

Arthur L. Liestman

Discret. Appl. Math., 2011

Dichotomy for tree-structured trigraph list homomorphism problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

The Dichotomy of List Homomorphisms for Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Retractions to Pseudoforests.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Faithful Representations of Graphs by Islands in the Extended Grid.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

Cycle transversals in bounded degree graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Adjusted Interval Digraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Adaptable chromatic number of graph products.

[BibT_eX]

[DOI]

Discret. Math., 2009

Linear-time certifying algorithms for near-graphical sequences.

[BibT_eX]

[DOI]

Discret. Math., 2009

Extension problems with degree bounds.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms

[BibT_eX]

[DOI]

CoRR, 2009

Generalizations of Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008

Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Near-Unanimity Functions and Varieties of Reflexive Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Oriented star packings.

[BibT_eX]

[DOI]

Romeo Rizzi

J. Comb. Theory B, 2008

On the adaptable chromatic number of graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

A dichotomy for minimum cost graph homomorphisms.

[BibT_eX]

[DOI]

Eur. J. Comb., 2008

On realizations of point determining graphs, and obstructions to full homomorphisms.

[BibT_eX]

[DOI]

Discret. Math., 2008

Polarity of chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Colouring, constraint satisfaction, and complexity.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2008

On Injective Colourings of Chordal Graphs.

[BibT_eX]

[DOI]

André Raspaud

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Minimum Cost Homomorphisms to Reflexive Digraphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

On the Density of Trigraph Homomorphisms.

[BibT_eX]

[DOI]

Jarik Nesetril

Graphs Comb., 2007

Matrix Partitions with Finitely Many Obstructions.

[BibT_eX]

[DOI]

Wing Xie

Electron. Notes Discret. Math., 2007

The structure of bi-arc trees.

[BibT_eX]

[DOI]

Discret. Math., 2007

List homomorphisms of graphs with bounded degrees.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

Full Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Independent packings in structured graphs.

[BibT_eX]

[DOI]

Kathie Cameron

Math. Program., 2006

The k-piece packing problem.

[BibT_eX]

[DOI]

David Hartvigsen

Jácint Szabó

J. Graph Theory, 2006

Matrix partitions of perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

Digraph matrix partitions and trigraph homomorphisms.

[BibT_eX]

[DOI]

Kim Tucker-Nally

Discret. Appl. Math., 2006

Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs

[BibT_eX]

[DOI]

CoRR, 2006

2005

List matrix partitions of chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A generalization of the theorem of Lekkerkerker and Boland.

[BibT_eX]

[DOI]

Discret. Math., 2005

Packing r-Cliques in Weighted Chordal Graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

Two algorithms for general list matrix partitions.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Interval bigraphs and circular arc graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2004

Polychromatic cliques.

[BibT_eX]

[DOI]

Juan José Montellano-Ballesteros

Discret. Math., 2004

Spanning spiders and light-splitting switches.

[BibT_eX]

[DOI]

Discret. Math., 2004

Partitioning chordal graphs into independent sets and cliques.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

List Partitions of Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Graphs and homomorphisms.

[BibT_eX]

Oxford lecture series in mathematics and its applications 28, Oxford University Press, ISBN: 978-0-19-852817-3, 2004

2003

Acyclic Homomorphisms and Circular Colorings of Digraphs.

[BibT_eX]

[DOI]

Bojan Mohar

SIAM J. Discret. Math., 2003

List Partitions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Broadcasting in generalized chordal rings.

[BibT_eX]

[DOI]

Francesc Comellas

Networks, 2003

Bi-arc graphs and the complexity of list homomorphisms.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Packing paths in digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

2002

Homomorphisms to powers of digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Antidirected hamiltonian paths between specified vertices of a tournament.

[BibT_eX]

[DOI]

Moshe Rosenfeld

Discret. Appl. Math., 2002

Spanning Trees with Bounded Number of Branch Vertices.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Coloring all directed paths in a symmetric tree, with an application to optical networks.

[BibT_eX]

[DOI]

Luisa Gargano

Stephane Perennes

J. Graph Theory, 2001

High-Girth Graphs Avoiding a Minor are Nearly Bipartite.

[BibT_eX]

[DOI]

Anna Galluccio

Luis A. Goddyn

J. Comb. Theory B, 2001

On generalized split graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On nice graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

André Raspaud

Éric Sopena

Discret. Math., 2001

Counting List Homomorphisms and Graphs with Bounded Degrees.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

The circular chromatic number of series-parallel graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Graph Packings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

On homomorphisms to edge-coloured cycles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

The complexity of H-colouring of bounded degree graphs.

[BibT_eX]

[DOI]

Anna Galluccio

Discret. Math., 2000

1999

List Homomorphisms and Circular Arc Graphs.

[BibT_eX]

[DOI]

Comb., 1999

Complexity of Graph Partition Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs.

[BibT_eX]

[DOI]

Ron Shamir

Roded Sharan

Proceedings of the Algorithms, 1999

1998

Constructions of large planar networks with given degree and diameter.

[BibT_eX]

[DOI]

Michael R. Fellows

Networks, 1998

List Homomorphisms to Reflexive Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1998

Optimal Wavelength-routed Multicasting.

[BibT_eX]

[DOI]

Bruno Beauquier

Stephane Perennes

Discret. Appl. Math., 1998

On the complexity of coloring areflexive h-ary relations with given permutation group.

[BibT_eX]

L. Haddad

Eric Mendelsohn

Ars Comb., 1998

Broadcasting in planar graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

1997

Two remarks on circular arc graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1997

The complexity of restricted graph homomorphisms.

[BibT_eX]

[DOI]

Discret. Math., 1997

Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing.

[BibT_eX]

[DOI]

Luisa Gargano

Stephane Perennes

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs.

[BibT_eX]

[DOI]

Binay K. Bhattacharya

SIAM J. Discret. Math., 1996

Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs.

[BibT_eX]

[DOI]

Xiaotie Deng

SIAM J. Comput., 1996

Complexity of Tree Homomorphisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1996

Rounding in Symmetric Matrices and Undirected Graphs.

[BibT_eX]

[DOI]

Brenda Li

Discret. Appl. Math., 1996

1995

The Existence of Homomorphisms to Oriented Cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1995

On homomorphisms to acyclic local tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

On the ultimate independence ratio of a graph.

[BibT_eX]

[DOI]

Gena Hahn

Svatopluk Poljak

Eur. J. Comb., 1995

Equicovering matroids by distinct bases.

[BibT_eX]

[DOI]

Pierre Fraisse

Eur. J. Comb., 1995

Hereditarily hard H-colouring problems.

[BibT_eX]

[DOI]

Discret. Math., 1995

Large Planar Graphs with Given Diameter and Maximum Degree.

[BibT_eX]

[DOI]

Michael R. Fellows

Discret. Appl. Math., 1995

Finding an Antidirected Hamiltonian Path Starting with a Forward Arc from a Given Vertex of a Tournament.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics and Computer Science, 1995

1994

Multiplicativity of Oriented Cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1994

Homomorphisms to oriented paths.

[BibT_eX]

[DOI]

Discret. Math., 1994

Independence ratios of graph powers.

[BibT_eX]

[DOI]

Xingxing Yu

Discret. Math., 1994

On chordal proper circular arc graphs.

[BibT_eX]

[DOI]

Discret. Math., 1994

Packing Problems in Edge-colored Graphs.

[BibT_eX]

[DOI]

Yannis Manoussakis

Zsolt Tuza

Discret. Appl. Math., 1994

1993

Graph endpoint coloring and distributed processing.

[BibT_eX]

[DOI]

Networks, 1993

On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs.

[BibT_eX]

[DOI]

Jean-Claude Bermond

J. Graph Theory, 1993

Algorithms for Degree Constrained Graph Factors of Minimum Deficiency.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Universality of A-mote Graphs.

[BibT_eX]

[DOI]

Roland Häggkvist

Eur. J. Comb., 1993

Largest planar graphs of diameter two and fixed maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 1993

Biography of Martin Farber, 1951-1989.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

Absolute Reflexive Retracts and Absolute Bipartite Retracts.

[BibT_eX]

[DOI]

Hans-Jürgen Bandelt

Martin Farber

Discret. Appl. Math., 1993

Homomorphisms to oriented cycles.

[BibT_eX]

[DOI]

Comb., 1993

1992

Broadcasting in Bounded Degree Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1992

Construction of Large Packet Radio Networks.

[BibT_eX]

[DOI]

Jean-Claude Bermond

Jean-Jacques Quisquater

Parallel Process. Lett., 1992

The core of a graph.

[BibT_eX]

[DOI]

Discret. Math., 1992

Achromatic numbers and graph operations.

[BibT_eX]

[DOI]

Donald J. Miller

Discret. Math., 1992

On the complexity of colouring by superdigraphs of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Sparse broadcast graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

Recognition and Representation of Proper Circular Arc Graphs.

[BibT_eX]

Xiaotie Deng

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1991

Images of Rigid Digraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1991

1990

A note on the star chromatic number.

[BibT_eX]

[DOI]

J. Adrian Bondy

J. Graph Theory, 1990

On the complexity of H-coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1990

A simple existence criterion for (g<f)- factors.

[BibT_eX]

[DOI]

Discret. Math., 1990

Preface.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

The effect of two cycles on the complexity of colourings by directed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Local Tournaments and Proper Circular Arc Gaphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1990

1988

On Restricted Two-Factors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

The Complexity of Colouring by Semicomplete Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Broadcasting in one dimension.

[BibT_eX]

[DOI]

Arthur L. Liestman

Discret. Appl. Math., 1988

On multiplicative graphs and the product conjecture.

[BibT_eX]

[DOI]

Comb., 1988

1987

On the problem of bandsize.

[BibT_eX]

[DOI]

Katherine Heinrich

Graphs Comb., 1987

1986

Concerning the achromatic number of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

A note onf-factors in directed and undirected multigraphs.

[BibT_eX]

[DOI]

Pierre Fraisse

Graphs Comb., 1986

1985

On the History of the Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Ronald L. Graham

IEEE Ann. Hist. Comput., 1985

1984

Packings by cliques and by finite families of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

1983

On the Complexity of General Graph Factor Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

The Complexity of Finding Generalized Paths in Tournaments.

[BibT_eX]

[DOI]

Moshe Rosenfeld

J. Algorithms, 1983

Counterexamples to theorems of Menger type for the diameter.

[BibT_eX]

[DOI]

J. Adrian Bondy

Discret. Math., 1983

1981

Parallel Sorting with Constant Time for Comparisons.

[BibT_eX]

[DOI]

Roland Häggkvist

SIAM J. Comput., 1981

On Generalized Matching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1979

An intermediate value theorem for graphs with given automorphism group.

[BibT_eX]

[DOI]

Louis V. Quintas

J. Graph Theory, 1979

1978

On the Completeness of a Generalized Matching Problem

[BibT_eX]

[DOI]

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1976

Graph with given achromatic number.

[BibT_eX]

[DOI]

Donald J. Miller

Discret. Math., 1976

1972

Graph decompositions, handcuffed prisoners and balanced P-designs.

[BibT_eX]

[DOI]