A note on vertex colorings of plane graphs
From MaRDI portal
Publication:472144
DOI10.7151/dmgt.1771zbMath1303.05037OpenAlexW1977952074MaRDI QIDQ472144
Jochen Harant, Igor Fabrici, Roman Soták, Stanlislav Jendroľ
Publication date: 18 November 2014
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1771
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on adjacent vertex distinguishing colorings of graphs
- Entire colouring of plane graphs
- Additive coloring of planar graphs
- On irregular total labellings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Lucky labelings of graphs
- On vertex-coloring 13-edge-weighting
- Every planar map is four colorable. I: Discharging
- Edge weights and vertex colours
- A note on face coloring entire weightings of plane graphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- How to Increase Robustness of Capable-to-Promise
- On graph irregularity strength
This page was built for publication: A note on vertex colorings of plane graphs