A note on face coloring entire weightings of plane graphs
From MaRDI portal
Publication:2450136
Recommendations
- A note on 2-facial coloring of plane graphs
- Facial entire colouring of plane graphs
- A note on vertex colorings of plane graphs
- Facially-constrained colorings of plane graphs: a survey
- scientific article; zbMATH DE number 1367494
- Colouring vertices of plane graphs under restrictions given by faces
- On simultaneous edge-face colorings of plane graphs
- scientific article; zbMATH DE number 5525887
- Coloring of plane graphs with unique maximal colors on faces
- scientific article; zbMATH DE number 1735788
Cites work
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- 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
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing index
- 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
(4)
This page was built for publication: A note on face coloring entire weightings of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450136)
