Edge-face list coloring of Halin graphs

DOI10.1007/978-3-030-57602-8_43zbMath1482.05110OpenAlexW3047788484MaRDI QIDQ2039700

Yanyan Li

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_43

zbMATH Keywords

wheel graphHalin graphcombinatorial Nullstellensatzedge-face list coloring

Mathematics Subject Classification ID

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

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Plane graphs with maximum degree 6 are edge-face 8-colorable
• On simultaneous edge-face colorings of plane graphs
• Simultaneously colouring the edges and faces of plane graphs
• A five-color theorem
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
• The edge-face choosability of plane graphs
• Combinatorial Nullstellensatz and DP-coloring of graphs
• Combinatorial Nullstellensatz
• On improving the edge-face coloring theorem

This page was built for publication: Edge-face list coloring of Halin graphs