Pages that link to "Item:Q3728016"

The following pages link to Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency (Q3728016):

Displaying 41 items.

• The t-improper chromatic number of random graphs (Q3503499) (← links)
• Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
• The <i>t</i>-Improper Chromatic Number of Random Graphs (Q3557526) (← links)
• A note on defective colorings of graphs in surfaces (Q3800061) (← links)
• Globally sparse vertex‐ramsey graphs (Q4277989) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• On t-relaxed chromatic number of r-power paths (Q4634519) (← links)
• On (<i>s,t</i>)-relaxed <i>L</i>(1,1)-labelling of trees (Q4976318) (← links)
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
• Defective colorings on <i>k</i>-uniform hypergraphs (Q5035064) (← links)
• (Q5092394) (← links)
• Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
• Not all planar graphs are in PURE-4-DIR (Q5119380) (← links)
• An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem (Q5136236) (← links)
• Defective and clustered choosability of sparse graphs (Q5222556) (← links)
• Improper Choosability and Property B (Q5325946) (← links)
• Improper coloring of graphs on surfaces (Q5379836) (← links)
• Some of My Favorite Coloring Problems for Graphs and Digraphs (Q5506778) (← links)
• (Q5708621) (← links)
• Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
• Acyclic colorings of planar graphs (Q5905418) (← links)
• Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)
• Locally planar graphs are 2-defective 4-paintable (Q5964254) (← links)
• Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
• A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles (Q6083188) (← links)
• 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Decomposition of toroidal graphs without some subgraphs (Q6178668) (← links)
• Extended MSO model checking via small vertex integrity (Q6185940) (← links)
• Graph partitions under average degree constraint (Q6187347) (← links)
• Sparse critical graphs for defective DP-colorings (Q6204323) (← links)
• Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736) (← links)
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)
• A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable (Q6585548) (← links)
• Introduction to competitive graph coloring (Q6599238) (← links)
• A note on Alon-Tarsi number of Halin graphs (Q6611029) (← links)
• On \(\delta^{(k)}\)-colouring of some wheel related graphs (Q6625081) (← links)
• Chromatic quasisymmetric class functions for combinatorial Hopf monoids (Q6655685) (← links)
• On two problems of defective choosability of graphs (Q6657596) (← links)
• Monochromatic graph decompositions inspired by anti-Ramsey colorings (Q6671396) (← links)