List 2-arboricity of planar graphs with no triangles at distance less than two

MaRDI QIDQ2454493zbMATH OpenFDO

Authors Oleg V. Borodin, Anna O. Ivanova

Publication date 13 June 2014

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v5/p211-214.pdf

zbMATH Keywords

4-choosabilityplanar graphvertex-arboricity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• List vertex arboricity of planar graphs of diameter two
• Two sufficient conditions for a planar graph to be list vertex-2-arborable
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
• The list linear arboricity of planar graphs
• List vertex-arboricity of planar graphs without intersecting 5-cycles
• List 2-distance coloring of planar graphs without short cycles
• On list vertex 2-arboricity of toroidal graphs without cycles of specific length
• List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
• scientific article; zbMATH DE number 6004909
• List 2-distance coloring of planar graphs

Cited in

(3)

• An analogue of DP-coloring for variable degeneracy and its applications
• A generalization of some results on list coloring and DP-coloring
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

This page was built for publication: List 2-arboricity of planar graphs with no triangles at distance less than two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454493)