Facial edge-face coloring of K₄-minor-free graphs

DOI10.1016/J.DISC.2020.111855MaRDI QIDQ2174603zbMATH OpenOpenAlexFDO

Authors Miaodi Xu, Min Chen

Publication date 21 April 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2020.111855

zbMATH Keywords

edge-face coloring\( K_4\)-minor-free graphfacial edge-face chromatic numberfacial edge-face coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Recommendations

• Weakly edge-face coloring of outer plane graphs
• On facial unique-maximum (edge-)coloring
• -facial edge colorings of graphs
• 3-facial edge-coloring of plane graphs
• Facial entire colouring of plane graphs

Cites work

• scientific article; zbMATH DE number 3298601 (Why is no real title available?)
• scientific article; zbMATH DE number 3339166 (Why is no real title available?)
• A five-color theorem
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• Facial entire colouring of plane graphs
• On improving the edge-face coloring theorem
• On simultaneous edge-face colorings of plane graphs
• Plane graphs with maximum degree 6 are edge-face 8-colorable
• Simultaneously colouring the edges and faces of plane graphs
• Weakly edge-face coloring of Halin graphs

Cited in

(1)

• Weakly edge-face coloring of outer plane graphs

This page was built for publication: Facial edge-face coloring of \(K_4\)-minor-free graphs

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