On purely tree-colorable planar graphs

DOI10.1016/J.IPL.2016.03.011MaRDI QIDQ280945zbMATHOpenAlexFDO

Authors Zepeng Li, Enqiang Zhu, Jin Xu

Publication date 10 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.03.011

zbMATH Keywords

combinatorial problemsdumbbell-maximal planar graphdumbbell-MPGmaximal planar graphpurely tree-\(k\)-colorabletree-\(k\)-coloring

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Maximal chromatic polynomials of connected planar graphs
• On unique coloring of planar graphs
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• scientific article; zbMATH DE number 4132187
• Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable

Cites work

• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3677862 (Why is no real title available?)
• scientific article; zbMATH DE number 1146229 (Why is no real title available?)
• scientific article; zbMATH DE number 3349917 (Why is no real title available?)
• A note on a matrix criterion for unique colorability of a signed graph
• Acyclic colorings of planar graphs
• Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
• Geometric coloring theory
• Graph theory
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
• On the coloring of signed graphs
• The four-colour theorem
• Uniquely Line Colorable Graphs
• Uniquely edge-3-colorable graphs and snarks

Cited in

(3)

• scientific article; zbMATH DE number 1929924 (Why is no real title available?)
• Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
• On generating series of coloured planar trees

This page was built for publication: On purely tree-colorable planar graphs

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