K. Cameron

发表

A note on perfect graphs

J. Edmonds, L. Lovász, K. Cameron, 1986 .

Recognition of Perfect Circular-arc Graphs

Kathie Cameron, Chính T. Hoàng, Elaine M. Eschen, 2006 .

Antichain sequences

Kathie Cameron, K. Cameron, 1985 .

The Algorithmics Column

T. Erlebach, K. Cameron, K. Vuskovic, 2020 .

Existentially Polytime Theorems

Kathie Cameron, Jack Edmonds, J. Edmonds, 1990, Polyhedral Combinatorics.

A PPA parity theorem about trees in a bipartite graph

J. Edmonds, K. Cameron, 2020, Discret. Appl. Math..

Monotone path systems in simple regions

Kathie Cameron, Horst Sachs, H. Sachs, 1994, Comb..

k-Critical Graphs in P5-Free Graphs

Yongtang Shi, Shenwei Huang, Kathie Cameron, 2020, International Computing and Combinatorics Conference.

An optimal χ ‐bound for ( P 6 , diamond)‐free graphs pdf

Shenwei Huang, Kathie Cameron, Owen Merkel, 2021, J. Graph Theory.

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

Vadim V. Lozin, Kathie Cameron, Rodica Boliac, 2004, Ars Comb..

Independent packings in structured graphs

Kathie Cameron, Pavol Hell, P. Hell, 2006, Math. Program..

Coloring vertices of a graph or finding a Meyniel obstruction pdf

Kathie Cameron, Benjamin Lévêque, Frédéric Maffray, 2005, Theor. Comput. Sci..

Colouring Some Classes of Perfect Graphs Robustly

Kathie Cameron, Jack Edmonds, J. Edmonds, 2005, Electron. Notes Discret. Math..

Some graphic uses of an even number of odd nodes

Kathie Cameron, Jack Edmonds, J. Edmonds, 1999, SODA '99.

Coloured matchings in bipartite graphs

Kathie Cameron, K. Cameron, 1997, Discret. Math..

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

Kathie Cameron, Chính T. Hoàng, K. Cameron, 2017, Discret. Appl. Math..

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

Shenwei Huang, Kathie Cameron, Vaidy Sivaraman, 2018, J. Graph Theory.

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

Shenwei Huang, Kathie Cameron, Kristina Vuskovic, 2016, Discret. Math..

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

Kathie Cameron, K. Cameron, 1989, Discret. Math..

SIGNED B-EDGE COVERS OF GRAPHS

KATHIE CAMERON, K. Cameron, CHANGPING WANG, 2007 .

On the structure of (pan, even hole)‐free graphs pdf

Steven Chaplick, Kathie Cameron, Chính T. Hoàng, 2015, J. Graph Theory.

A BOUND FOR THE CHROMATIC NUMBER OF ( $P_{5}$ , GEM)-FREE GRAPHS

Owen D. Merkel, KATHIE CAMERON, K. Cameron, 2019, Bulletin of the Australian Mathematical Society.

Lambda composition

Kathie Cameron, Jack Edmonds, J. Edmonds, 1997, J. Graph Theory.

The list partition problem for graphs

Kathie Cameron, Chính T. Hoàng, Elaine M. Eschen, 2004, SODA '04.

Induced Matchings in Intersection Graphs

Kathie Cameron, K. Cameron, 2000, Electron. Notes Discret. Math..

Finding a maximum induced matching in weakly chordal graphs

Kathie Cameron, R. Sritharan, Yingwen Tang, 2003, Discret. Math..

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

Kathie Cameron, Tracy Walker, K. Cameron, 2005, Discret. Math..

k-Critical Graphs in P5-Free Graphs

Yongtang Shi, Shenwei Huang, Kathie Cameron, 2020, COCOON.

Finding a Strong Stable Set or a Meyniel Obstruction in any Graph

Kathie Cameron, Jack Edmonds, J. Edmonds, 2005 .

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

Kathie Cameron, K. Cameron, 2001, Discret. Math..

Induced matchings

K. Cameron, K. Cameron, 1989, Discret. Appl. Math..

A parity theorem about trees with specified degrees

Kathie Cameron, K. Cameron, 2021, Discret. Appl. Math..

Cycles containing all the odd-degree vertices

Kathie Cameron, Carsten Thomassen, C. Thomassen, 2020, J. Comb. Theory, Ser. B.

The Complexity of the List Partition Problem for Graphs

Kathie Cameron, Chính T. Hoàng, Elaine M. Eschen, 2007, SIAM J. Discret. Math..

On an adjacency property of almost all tournaments

Anthony Bonato, Kathie Cameron, A. Bonato, 2006, Discret. Math..