Pages that link to "Item:Q404440"

The following pages link to Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs (Q404440):

Displaying 22 items.

• Path partitioning planar graphs of girth 4 without adjacent short cycles (Q1615735) (← links)
• Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
• An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
• Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
• On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
• Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
• Path partitioning planar graphs with restrictions on short cycles (Q2234425) (← links)
• Defective DP-colorings of sparse simple graphs (Q2237221) (← links)
• Near-colorings: non-colorable graphs and NP-completeness (Q2260631) (← links)
• Relaxed equitable colorings of planar graphs with girth at least 8 (Q2305904) (← links)
• Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← links)
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
• Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (Q2800597) (← links)
• (Q3304104) (← links)
• Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
• Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
• Defective and clustered choosability of sparse graphs (Q5222556) (← links)
• Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
• An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
• Graph partitions under average degree constraint (Q6187347) (← links)
• Sparse critical graphs for defective DP-colorings (Q6204323) (← links)