Kathie Cameron

Discret. Appl. Math., 2022

2021

k-Critical graphs in P5-free graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

An optimal χ -bound for ( P 6 , diamond)-free graphs.

[BibT_eX]

[DOI]

Shenwei Huang

Owen D. Merkel

J. Graph Theory, 2021

A parity theorem about trees with specified degrees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

2020

The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Cycles containing all the odd-degree vertices.

[BibT_eX]

[DOI]

Carsten Thomassen

J. Comb. Theory, Ser. B, 2020

Hadwiger's Conjecture for some hereditary classes of graphs: a survey.

[BibT_eX]

[DOI]

Kristina Vuskovic

Bull. EATCS, 2020

k-Critical Graphs in P5-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Solving the clique cover problem on (bull, C4)-free graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

On the structure of (pan, even hole)-free graphs.

[BibT_eX]

[DOI]

Steven Chaplick

J. Graph Theory, 2018

Structure and algorithms for (cap, even hole)-free graphs.

[BibT_eX]

[DOI]

Murilo V. G. da Silva

Shenwei Huang

Kristina Vuskovic

Discret. Math., 2018

An Optimal χ-Bound for (P6, diamond)-Free Graphs.

[BibT_eX]

[DOI]

Shenwei Huang

Owen D. Merkel

CoRR, 2018

2017

Solving the clique cover problem on (bull, C4)-free graphs.

[BibT_eX]

[DOI]

CoRR, 2017

2013

Edge Intersection Graphs of L-Shaped Paths in Grids.

[BibT_eX]

[DOI]

Steven Chaplick

Electron. Notes Discret. Math., 2013

2012

Coloring vertices of a graph or finding a Meyniel obstruction.

[BibT_eX]

[DOI]

Benjamin Lévêque

Frédéric Maffray

Theor. Comput. Sci., 2012

2011

Characterizing directed path graphs by forbidden asteroids.

[BibT_eX]

[DOI]

Benjamin Lévêque

J. Graph Theory, 2011

2009

Asteroids in rooted and directed path graphs.

[BibT_eX]

[DOI]

Benjamin Lévêque

Electron. Notes Discret. Math., 2009

Brambles and independent packings in chordal graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Intermediate Trees.

[BibT_eX]

[DOI]

Joanna B. Fawcett

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

The travelling preacher, projection, and a lower bound for the stability number of a graph.

[BibT_eX]

[DOI]

Discret. Optim., 2008

2007

The Complexity of the List Partition Problem for Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

2006

Independent packings in structured graphs.

[BibT_eX]

[DOI]

Pavol Hell

Math. Program., 2006

On the structure of certain intersection graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

On an adjacency property of almost all tournaments.

[BibT_eX]

[DOI]

Anthony Bonato

Discret. Math., 2006

2005

Colouring Some Classes of Perfect Graphs Robustly.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

The graphs with maximum induced matching and maximum matching the same size.

[BibT_eX]

[DOI]

Tracy Walker

Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction

[BibT_eX]

[DOI]

CoRR, 2005

2004

On computing the dissociation number and the induced matching number of bipartite graphs.

[BibT_eX]

Rodica Boliac

Vadim V. Lozin

Ars Comb., 2004

The list partition problem for graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Finding a maximum induced matching in weakly chordal graphs.

[BibT_eX]

[DOI]

R. Sritharan

Yingwen Tang

Discret. Math., 2003

2001

Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

On an adjacency property of almost all graphs.

[BibT_eX]

[DOI]

Anthony Bonato

Discret. Math., 2001

Connected Matchings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

2000

Induced Matchings in Intersection Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

On 2-e.c. graphs, tournaments, and hypergraphs.

[BibT_eX]

[DOI]

Anthony Bonato

Electron. Notes Discret. Math., 2000

A Min-Max Relation for Monotone Path Systems in Simple Regions.

[BibT_eX]

[DOI]

Comb., 2000

1999

Some Graphic Uses of an Even Number of Odd Nodes.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997

Lambda composition.

[BibT_eX]

[DOI]

J. Graph Theory, 1997

Coloured matchings in bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1994

Monotone Path Systems in Simple Regions.

[BibT_eX]

[DOI]

Horst Sachs

Comb., 1994

1992

Coflow polyhedra.

[BibT_eX]

[DOI]

Discret. Math., 1992

1990

An algorithmic note on the gallai-milgram theorem.

[BibT_eX]

[DOI]

Networks, 1990

Existentially Polytime Theorems.

[BibT_eX]

[DOI]

Proceedings of the Polyhedral Combinatorics, 1990

1989

A min-max relation for the partial q- colourings of a graph. Part II: Box perfection.

[BibT_eX]

[DOI]

Discret. Math., 1989

Induced matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

1986

On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic Digraphs.

[BibT_eX]

[DOI]