The following pages link to Kathie Cameron (Q168646):
Displaying 50 items.
- Edge intersection graphs of \(L\)-shaped paths in grids (Q299080) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Antichain sequences (Q1070251) (← links)
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs (Q1082350) (← links)
- A note on perfect graphs (Q1084108) (← links)
- Coflow polyhedra (Q1197009) (← links)
- Induced matchings (Q1262877) (← links)
- Some graphic uses of an even number of odd nodes (Q1296145) (← links)
- Monotone path systems in simple regions (Q1323475) (← links)
- Coloured matchings in bipartite graphs (Q1357740) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- A PPA parity theorem about trees in a bipartite graph (Q2064287) (← links)
- Cycles containing all the odd-degree vertices (Q2173434) (← links)
- A parity theorem about trees with specified degrees (Q2235250) (← links)
- Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
- On an adjacency property of almost all tournaments (Q2433700) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- On 2-e. c. line-critical graphs (Q2747185) (← links)
- On 2-e.c. graphs, tournaments, and hypergraphs (Q2816060) (← links)
- Induced matchings in intersection graphs (Q2816065) (← links)
- Asteroids in rooted and directed path graphs (Q2839213) (← links)
- An algorithmic note on the gallai-milgram theorem (Q3033587) (← links)
- Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
- (Q3348434) (← links)
- (Q3424773) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- The Complexity of the List Partition Problem for Graphs (Q3544241) (← links)
- (Q3576689) (← links)
- (Q3870942) (← links)
- (Q3983239) (← links)
- Lambda composition (Q4355067) (← links)
- (Q4414635) (← links)
- On the structure of (pan, even hole)‐free graphs (Q4604020) (← links)
- (Q5011877) (← links)
- The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness (Q5110670) (← links)
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874) (← links)
- (Q5463498) (← links)
- (Q5501285) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- A min-max relation for monotone path systems in simple regions (Q5928596) (← links)
- On an adjacency property of almost all graphs (Q5937580) (← links)
- Thomason's algorithm for finding a second Hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs (Q5937919) (← links)
