List coloring and diagonal coloring for plane graphs of diameter two

DOI10.1016/J.AMC.2019.124562MaRDI QIDQ2286099zbMATH OpenOpenAlexFDO

Authors Danjun Huang, Jing Lv, Yanping Yang, Yiqiao Wang, Weifan Wang

Publication date 9 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.124562

zbMATH Keywords

diagonal coloringlist coloringplane graph of diameter two

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
• List 2-distance coloring of planar graphs with maximal degree less than 5
• List 2-distance coloring of planar graphs without short cycles
• List 2-distance coloring of planar graphs
• Largest planar graphs of diameter two and fixed maximum degree

Cites work

• Choosability and edge choosability of planar graphs without five cycles
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Diagonal 11-coloring of plane triangulations
• Every planar graph is 5-choosable
• scientific article; zbMATH DE number 4043860 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 890665 (Why is no real title available?)
• List colourings of planar graphs
• Maximal planar graphs of diameter two
• On Diagonally 10‐Coloring Plane Triangulations
• On structure of some plane graphs with application to choosability
• On the vertex arboricity of planar graphs of diameter two
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without chordal 6-cycles are 4-choosable
• Planar graphs without intersecting 5-cycles are 4-choosable
• Planar graphs without triangular 4-cycles are 3-choosable
• The 4-choosability of plane graphs without 4-cycles

Cited in

(7)

• Structure and pancyclicity of maximal planar graphs with diameter two
• On list \(r\)-hued coloring of outer-1-planar graphs
• Computation on the difference of Zagreb indices of maximal planar graphs with diameter two
• The two-coloring number and degenerate colorings of planar graphs
• Weak diameter coloring of graphs on surfaces
• List recoloring of planar graphs
• B-coloring of \(\mathcal{MP}_2\)-graphs

This page was built for publication: List coloring and diagonal coloring for plane graphs of diameter two

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