Looseness of plane graphs

DOI10.1007/s00373-010-0961-6zbMath1234.05064OpenAlexW2025176109MaRDI QIDQ659673

Július Czap, František Kardoš, Jozef Miškuf, Stanlislav Jendroľ

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00634940/file/CJK_11.pdf

zbMATH Keywords

plane graphvertex colouringdual graphloose colouringloose faceloosenees of plane triangulationslooseness

Mathematics Subject Classification ID

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

Related Items (3)

Facially-constrained colorings of plane graphs: a survey ⋮ Facial achromatic number of triangulations on the sphere ⋮ Looseness and independence number of triangulations on closed surfaces

Cites Work

• Rainbowness of cubic plane graphs
• Colorings of planar graphs with no rainbow faces
• Maximum face-constrained coloring of plane graphs
• Colouring planar mixed hypergraphs
• Looseness ranges of triangulations on closed surfaces
• Every Planar Map is Four Colorable
• Gaps in the chromatic spectrum of face-constrained plane graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Looseness of plane graphs