A note on vertex colorings of plane graphs
From MaRDI portal
Publication:472144
DOI10.7151/DMGT.1771zbMATH Open1303.05037OpenAlexW1977952074MaRDI QIDQ472144FDOQ472144
Authors: Igor Fabrici, Jochen Harant, Roman Soták, Stanislav 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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- On vertex-coloring 13-edge-weighting
- Every planar map is four colorable. I: Discharging
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- A note on adjacent vertex distinguishing colorings of graphs
- On a \(1,2\) conjecture
- Title not available (Why is that?)
- On graph irregularity strength
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- How to Increase Robustness of Capable-to-Promise
- A note on face coloring entire weightings of plane graphs
Cited In (9)
- A note on face coloring entire weightings of plane graphs
- A note on adjacent vertex distinguishing colorings of graphs
- Parity vertex colouring of plane graphs
- Title not available (Why is that?)
- Note on vertex degrees of planar graphs
- A note on the minimum total coloring of planar graphs
- A note on maximum differential coloring of planar graphs
- Colourings of graphs by labellings
- Title not available (Why is that?)
This page was built for publication: A note on vertex colorings of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472144)
