A note on vertex colorings of plane graphs
From MaRDI portal
Publication:472144
Recommendations
Cites work
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- A note on adjacent vertex distinguishing colorings of graphs
- A note on face coloring entire weightings of plane graphs
- Additive coloring of planar graphs
- Degree constrained subgraphs
- Edge weights and vertex colours
- Entire colouring of plane graphs
- Every planar map is four colorable. I: Discharging
- Graph theory
- How to Increase Robustness of Capable-to-Promise
- Lucky labelings of graphs
- On a \(1,2\) conjecture
- On graph irregularity strength
- On irregular total labellings
- On vertex-coloring 13-edge-weighting
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex-colouring edge-weightings
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
- scientific article; zbMATH DE number 5525887 (Why is no real title available?)
- A note on the minimum total coloring of planar graphs
- Note on vertex degrees of planar graphs
- A note on maximum differential coloring of planar graphs
- Colourings of graphs by labellings
- scientific article; zbMATH DE number 1934402 (Why is no real title available?)
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)