Edge-partitions of planar graphs and their game coloring numbers
From MaRDI portal
Publication:4798121
DOI10.1002/jgt.10069zbMath1016.05033OpenAlexW3210219087WikidataQ60060257 ScholiaQ60060257MaRDI QIDQ4798121
Xiaoling Hou, Wenjie He, Jiating Shao, Xuding Zhu, Ko-Wei Lih, Wei Fan Wang
Publication date: 19 March 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10069
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ A simple competitive graph coloring algorithm. III ⋮ Decomposing 4-connected planar triangulations into two trees and one path ⋮ The List \(L(2, 1)\)-labeling of planar graphs ⋮ Covering planar graphs with forests, one having a bounded maximum degree ⋮ Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ Generalized planar Turán numbers ⋮ List injective colorings of planar graphs ⋮ Game-perfect digraphs ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ Decomposing plane cubic graphs ⋮ Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs ⋮ The game chromatic number and the game colouring number of classes of oriented cactuses ⋮ The game Grundy number of graphs ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Decomposing a planar graph with girth 9 into a forest and a matching ⋮ Majority coloring game ⋮ On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers ⋮ Partitioning a Planar Graph of Girth 10 into a Forest and a Matching ⋮ Refined activation strategy for the marking game ⋮ The game coloring number of planar graphs with a specific girth ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ Spanning tree with lower bound on the degrees ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ Injective coloring of planar graphs ⋮ Decomposing a planar graph with girth at least 8 into a forest and a matching ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ The game coloring number of planar graphs with a given girth ⋮ The incidence game chromatic number of \((a,d)\)-decomposable graphs ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Game coloring the Cartesian product of graphs ⋮ M-degrees of quadrangle-free planar graphs ⋮ The 6-relaxed game chromatic number of outerplanar graphs ⋮ Planar graphs decomposable into a forest and a matching ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ Lightness of digraphs in surfaces and directed game chromatic number ⋮ Decomposing a graph into forests ⋮ Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable ⋮ Asymmetric directed graph coloring games ⋮ Towards obtaining a 3-decomposition from a perfect matching ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree ⋮ Note on 3-paths in plane graphs of girth 4 ⋮ The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles
