Looseness of plane graphs
From MaRDI portal
Publication:659673
DOI10.1007/s00373-010-0961-6zbMath1234.05064MaRDI 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
plane graph; vertex colouring; dual graph; loose colouring; loose face; loosenees of plane triangulations; looseness
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Looseness and independence number of triangulations on closed surfaces, Facial achromatic number of triangulations on the sphere, Facially-constrained colorings of plane graphs: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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