Pages that link to "Item:Q4309985"

The following pages link to Radius two trees specify χ‐bounded classes (Q4309985):

Displaying 50 items.

• Asymmetric coloring games on incomparability graphs (Q324375) (← links)
• Bounds on the game transversal number in hypergraphs (Q326647) (← links)
• On two problems in graph Ramsey theory (Q377800) (← links)
• Maximum planar subgraphs in dense graphs (Q396794) (← links)
• Adapted game colouring of graphs (Q412230) (← links)
• The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
• The game Grundy indices of graphs (Q498433) (← links)
• The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
• The game chromatic index of wheels (Q643001) (← links)
• Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
• Generalised game colouring of graphs (Q878606) (← links)
• The relaxed game chromatic index of \(k\)-degenerate graphs (Q879391) (← links)
• The relaxed edge-coloring game and \(k\)-degenerate graphs (Q890010) (← links)
• Note on the game colouring number of powers of graphs (Q907829) (← links)
• On forbidden subdivision characterizations of graph classes (Q925035) (← links)
• The 6-relaxed game chromatic number of outerplanar graphs (Q998330) (← links)
• Lightness of digraphs in surfaces and directed game chromatic number (Q1025549) (← links)
• Colouring games on outerplanar graphs and trees (Q1025941) (← links)
• Activation strategy for relaxed asymmetric coloring games (Q1025957) (← links)
• Fraternal augmentations, arrangeability and linear Ramsey numbers (Q1039442) (← links)
• Circular game chromatic number of graphs (Q1043981) (← links)
• Game colouring of the square of graphs (Q1043984) (← links)
• Generalization of transitive fraternal augmentations for directed graphs and its applications (Q1043997) (← links)
• Colouring graphs with bounded generalized colouring number (Q1045038) (← links)
• A bound for the game chromatic number of graphs (Q1297403) (← links)
• The game coloring number of planar graphs (Q1305532) (← links)
• A simple competitive graph coloring algorithm. II. (Q1425110) (← links)
• A simple competitive graph coloring algorithm (Q1569067) (← links)
• Chromatic numbers of exact distance graphs (Q1633747) (← links)
• Planar graphs have two-coloring number at most 8 (Q1745736) (← links)
• A new upper bound on the game chromatic index of graphs (Q1753125) (← links)
• Relaxed game chromatic number of trees and outerplanar graphs (Q1827712) (← links)
• Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
• A simple competitive graph coloring algorithm. III (Q1880795) (← links)
• Note on the game chromatic index of trees (Q1884997) (← links)
• The strong game colouring number of directed graphs (Q1945951) (← links)
• The game Grundy number of graphs (Q1956234) (← links)
• The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
• Infinite chromatic games (Q2065775) (← links)
• \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
• Game chromatic number of strong product graphs (Q2092388) (← links)
• PSPACE-hardness of two graph coloring games (Q2132363) (← links)
• On coloring numbers of graph powers (Q2174571) (← links)
• PSPACE-completeness of two graph coloring games (Q2182325) (← links)
• A connected version of the graph coloring game (Q2192130) (← links)
• Uniform orderings for generalized coloring numbers (Q2225419) (← links)
• On the weak 2-coloring number of planar graphs (Q2237215) (← links)
• Ramsey-goodness -- and otherwise (Q2259367) (← links)
• The difference between game chromatic number and chromatic number of graphs (Q2274521) (← links)