On purely tree-colorable planar graphs

DOI10.1016/j.ipl.2016.03.011zbMath1335.05052OpenAlexW2330255013MaRDI QIDQ280945

Zepeng Li, Jin Xu, En-Qiang Zhu

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)

Cites Work

• Geometric coloring theory
• The four-colour theorem
• Uniquely edge-3-colorable graphs and snarks
• On the coloring of signed graphs
• A note on a matrix criterion for unique colorability of a signed graph
• Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
• ON THE CHROMATIC INDEX OF A GRAPH, III: UNIQUELY EDGE-COLOURABLE GRAPHS
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
• Uniquely Line Colorable Graphs
• Acyclic colorings of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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