Kathie Cameron - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2022

A PPA parity theorem about trees in a bipartite graphKathie Cameron, Jack R. Edmonds. DAM, 308:107-110, 2022. [doi]

2021

A parity theorem about trees with specified degreesKathie Cameron. DAM, 305:48-55, 2021. [doi]

An optimal χ -bound for ( P 6 , diamond)-free graphsKathie Cameron, Shenwei Huang, Owen D. Merkel. jgt, 97(3):451-465, 2021. [doi]

5-free graphsKathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi. TCS, 864:80-91, 2021. [doi]

2020

2019

Solving the clique cover problem on (bull, C4)-free graphsKathie Cameron, Chính T. Hoàng. DAM, 261:119-122, 2019. [doi]

2018

On the structure of (pan, even hole)-free graphsKathie Cameron, Steven Chaplick, Chính T. Hoàng. jgt, 87(1):108-129, 2018. [doi]

Structure and algorithms for (cap, even hole)-free graphsKathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic. DM, 341(2):463-473, 2018. [doi]

2016

Edge intersection graphs of L-shaped paths in gridsKathie Cameron, Steven Chaplick, Chính T. Hoàng. DAM, 210:185-194, 2016. [doi]

2013

Edge Intersection Graphs of L-Shaped Paths in GridsKathie Cameron, Steven Chaplick, Chính T. Hoàng. endm, 44:363-369, 2013. [doi]

2012

Coloring vertices of a graph or finding a Meyniel obstructionKathie Cameron, Benjamin Lévêque, Frédéric Maffray. TCS, 428:10-17, 2012. [doi]

2011

Characterizing directed path graphs by forbidden asteroidsKathie Cameron, Chính T. Hoàng, Benjamin Lévêque. jgt, 68(2):103-112, 2011. [doi]

2009

Intermediate TreesKathie Cameron, Joanna Fawcett. colognetwente 2009: 120-121 [doi]

Brambles and independent packings in chordal graphsKathie Cameron. DM, 309(18):5766-5769, 2009. [doi]

Asteroids in rooted and directed path graphsKathie Cameron, Chính T. Hoàng, Benjamin Lévêque. endm, 32:67-74, 2009. [doi]

2008

The travelling preacher, projection, and a lower bound for the stability number of a graphKathie Cameron, Jack Edmonds. disopt, 5(2):290-292, 2008. [doi]

2007

The Complexity of the List Partition Problem for GraphsKathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan. siamdm, 21(4):900-929, 2007. [doi]

2006

On an adjacency property of almost all tournamentsAnthony Bonato, Kathie Cameron. DM, 306(19-20):2327-2335, 2006. [doi]

Independent packings in structured graphsKathie Cameron, Pavol Hell. mp, 105(2-3):201-213, 2006. [doi]

On the structure of certain intersection graphsKathie Cameron, Chính T. Hoàng. ipl, 99(2):59-63, 2006. [doi]

2005

The graphs with maximum induced matching and maximum matching the same sizeKathie Cameron, Tracy Walker. DM, 299(1-3):49-55, 2005. [doi]

Colouring Some Classes of Perfect Graphs RobustlyKathie Cameron, Jack Edmonds. endm, 22:553-556, 2005. [doi]

2004

On computing the dissociation number and the induced matching number of bipartite graphsRodica Boliac, Kathie Cameron, Vadim V. Lozin. arscom, 72, 2004.

Induced matchings in intersection graphsKathie Cameron. DM, 278(1-3):1-9, 2004. [doi]

The list partition problem for graphsKathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan. soda 2004: 391-399 [doi]

2003

Finding a maximum induced matching in weakly chordal graphsKathie Cameron, R. Sritharan, Yingwen Tang. DM, 266(1-3):133-142, 2003. [doi]

2001

Connected MatchingsKathie Cameron. aussois 2003: 34-38 [doi]

Thomason s algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk s graphsKathie Cameron. DM, 235(1-3):69-77, 2001. [doi]

2000

On 2-e.c. graphs, tournaments, and hypergraphsAnthony Bonato, Kathie Cameron. endm, 5:31-34, 2000. [doi]

A Min-Max Relation for Monotone Path Systems in Simple RegionsKathie Cameron. combinatorica, 20(3):435-440, 2000. [doi]

Induced Matchings in Intersection GraphsKathie Cameron. endm, 5:50-52, 2000. [doi]

1999

Some Graphic Uses of an Even Number of Odd NodesKathie Cameron, Jack Edmonds. soda 1999: 872 [doi]

1997

Coloured matchings in bipartite graphsKathie Cameron. DM, 169(1-3):205-209, 1997. [doi]

Lambda compositionKathie Cameron, Jack Edmonds. jgt, 26(1):9-16, 1997. [doi]

1994

Monotone Path Systems in Simple RegionsKathie Cameron, Horst Sachs. combinatorica, 14(1):1-21, 1994.

1992

Coflow polyhedraKathie Cameron, Jack Edmonds. DM, 101(1-3):1-21, 1992. [doi]

1990

An algorithmic note on the gallai-milgram theoremKathie Cameron. networks, 20(1):43-48, 1990. [doi]

Existentially Polytime TheoremsKathie Cameron, Jack Edmonds. dimacs 1990: 83-100

1989

Induced matchingsKathie Cameron. DAM, 24(1-3):97-102, 1989. [doi]

A min-max relation for the partial q- colourings of a graph. Part II: Box perfectionKathie Cameron. DM, 74(1-2):15-27, 1989. [doi]

1986

On k-Optimum Dipath Partitions and Partial k-Colourings of Acyclic DigraphsKathie Cameron. ejc, 7(2):115-118, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL