Pages that link to "Item:Q3652554"

The following pages link to Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554):

Displaying 18 items.

• List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
• A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
• List total arboricity of 2-degenerate graphs (Q714512) (← links)
• List vertex-arboricity of planar graphs without intersecting 5-cycles (Q1987594) (← links)
• An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
• Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles (Q2074364) (← links)
• Cover and variable degeneracy (Q2075519) (← links)
• Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
• A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
• List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles (Q2671036) (← links)
• Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
• Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
• A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
• List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
• Signed colouring and list colouring of k‐chromatic graphs (Q6057660) (← links)
• A note on the list vertex-arboricity of IC-planar graphs (Q6542022) (← links)
• Partitioning a planar graph without chordal 5-cycles into two forests. (Q6584425) (← links)
• Light 3-faces in 3-polytopes without adjacent triangles (Q6635125) (← links)