Coloring edges of embedded graphs
From MaRDI portal
Recommendations
- Edge colorings of graphs embeddable in a surface of low genus
- Coloring edges of graphs embedded in a surface of characteristic zero.
- scientific article; zbMATH DE number 2192155
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
- Edge colorings of embedded graphs
Cites work
Cited in
(20)- The edge-face coloring of graphs embedded in a surface of characteristic zero
- Mixed graph edge coloring
- Edge coloring of graphs with small maximum degrees
- Embedding finite graphs into graphs colored with infinitely many colors
- Coloring edges of graphs embedded in a surface of characteristic zero.
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
- Edge colorings of embedded graphs
- On simultaneous colorings of embedded graphs
- Parsimonious edge coloring
- Simultaneous embedding of colored graphs
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
- Edge colourings of embedded 1-graphs
- Edge colourings of embedded special graphs
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
- On edge colorings of 1-toroidal graphs
- Parsimonious edge-coloring on surfaces
- scientific article; zbMATH DE number 2192155 (Why is no real title available?)
- Complexity issues in color-preserving graph embeddings
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
This page was built for publication: Coloring edges of embedded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521489)