Efficient graph packing via game colouring

DOI10.1017/S0963548309009973MaRDI QIDQ3552503zbMATH OpenOpenAlexFDO

Authors H. A. Kierstead, Alexandr Kostochka

Publication date 22 April 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548309009973

zbMATH Keywords

graph packinggame coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Games involving graphs (91A43)

Recommendations

• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• On a packing problem of Alon and Yuster
• On Packing Two Graphs with Bounded Sum of Sizes and Maximum Degree
• A near packing of two graphs
• Packing \(d\)-degenerate graphs

Cites work

• A bound for the game chromatic number of graphs
• A simple competitive graph coloring algorithm
• An Ore-type analogue of the Sauer-Spencer theorem
• Edge disjoint placement of graphs
• Grad and classes with bounded expansion. I: Decompositions
• Graphs with linearly bounded Ramsey numbers
• Marking games and the oriented game chromatic number of partial k-trees
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On Two Conjectures on Packing of Graphs
• Orderings on graphs and game coloring number
• Packings of graphs and applications to computational complexity
• Refined activation strategy for the marking game
• Subgraphs of graphs. I
• The Ramsey number of a graph with bounded maximum degree
• The game coloring number of pseudo partial \(k\)-trees

Cited in

(19)

• 2-coloring number revisited
• On game chromatic vertex-critical graphs
• Game chromatic number of generalized Petersen graphs and Jahangir graphs
• Indicated coloring game on Cartesian products of graphs
• Adapted game colouring of graphs
• On the degree of trees with game chromatic number 4
• Circular game chromatic number of graphs
• Uniform orderings for generalized coloring numbers
• Between packable and arbitrarily packable graphs: Packer-spoiler games
• On caterpillars of game chromatic number 4
• A Game Theoretic Approach for Efficient Graph Coloring
• Bounds on the game transversal number in hypergraphs
• Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
• The independence coloring game on graphs
• Maximum 0-1 timed matching on temporal graphs
• Domination game on uniform hypergraphs
• Chromatic numbers of exact distance graphs
• Indicated coloring of graphs
• Uniquely colorable graphs with equal chromatic and game chromatic numbers

This page was built for publication: Efficient graph packing via game colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552503)