Edge-face coloring of 2-connected plane graphs
From MaRDI portal
Recommendations
- Edge-face chromatic number of 2-connected plane graphs with high maximum degree
- Plane graphs of maximum degree 7 are edge-face ( + 1)-colorable
- scientific article; zbMATH DE number 1229621
- Simultaneous coloring of edges and faces of plane graphs
- Edge-face coloring of plane graphs with maximum degree nine
Cited in
(15)- The edge-face coloring of graphs embedded in a surface of characteristic zero
- On simultaneous edge-face colorings of plane graphs
- Simultaneous coloring of edges and faces of plane graphs
- Edge-face chromatic number of 2-connected plane graphs with high maximum degree
- A note on the edge-face total chromatic number of maximal outerplanar graphs
- Every plane graph of maximum degree 8 has an edge-face 9-coloring
- Edge-face coloring of plane graphs with maximum degree nine
- Face 2-Colorable Embeddings with Faces of Specified Lengths
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- scientific article; zbMATH DE number 1229621 (Why is no real title available?)
- scientific article; zbMATH DE number 1512130 (Why is no real title available?)
- scientific article; zbMATH DE number 1367494 (Why is no real title available?)
- Plane graphs of maximum degree 7 are edge-face ( + 1)-colorable
- Edge‐face chromatic number and edge chromatic number of simple plane graphs
- An improved upper bound on the edge-face coloring of 2-connected plane graphs
This page was built for publication: Edge-face coloring of 2-connected plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063962)
