Pages that link to "Item:Q4798121"

The following pages link to Edge-partitions of planar graphs and their game coloring numbers (Q4798121):

Displaying 44 items.

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) (Q345121) (← links)
• Decomposition of sparse graphs into two forests, one having bounded maximum degree (Q407602) (← links)
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
• The coloring game on planar graphs with large girth, by a result on sparse cactuses (Q512597) (← links)
• Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048) (← links)
• List injective colorings of planar graphs (Q615993) (← links)
• Decomposing a graph into forests (Q765188) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• Decomposing plane cubic graphs (Q896062) (← links)
• Decomposing a planar graph with girth 9 into a forest and a matching (Q925026) (← links)
• Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
• Decomposition of sparse graphs, with application to game coloring number (Q968426) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
• Planar graphs decomposable into a forest and a matching (Q998522) (← links)
• Covering planar graphs with forests, one having bounded maximum degree (Q1003834) (← links)
• Lightness of digraphs in surfaces and directed game chromatic number (Q1025549) (← links)
• Asymmetric directed graph coloring games (Q1045076) (← links)
• Decomposing 4-connected planar triangulations into two trees and one path (Q1633745) (← links)
• The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
• Majority coloring game (Q1727720) (← links)
• On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers (Q1732763) (← links)
• The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
• Spanning tree with lower bound on the degrees (Q1744244) (← links)
• A simple competitive graph coloring algorithm. III (Q1880795) (← links)
• Game-perfect digraphs (Q1935960) (← links)
• The game chromatic number and the game colouring number of classes of oriented cactuses (Q1944077) (← links)
• The game Grundy number of graphs (Q1956234) (← links)
• The game coloring number of planar graphs with a given girth (Q2017053) (← links)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• Towards obtaining a 3-decomposition from a perfect matching (Q2094896) (← links)
• Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
• Note on 3-paths in plane graphs of girth 4 (Q2344794) (← links)
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs (Q2427530) (← links)
• Refined activation strategy for the marking game (Q2464148) (← links)
• Generalized planar Turán numbers (Q2665977) (← links)
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (Q2862551) (← links)
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k (Q3055928) (← links)
• The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles (Q3439319) (← links)
• Partitioning a Planar Graph of Girth 10 into a Forest and a Matching (Q3553247) (← links)
• Game coloring the Cartesian product of graphs (Q3605153) (← links)
• <i>M</i>-degrees of quadrangle-free planar graphs (Q3605161) (← links)
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
• Covering planar graphs with forests, one having a bounded maximum degree (Q5301001) (← links)
• Injective coloring of planar graphs (Q5902135) (← links)