Edge coloring of embedded graphs with large girth
From MaRDI portal
Recommendations
Cited in
(16)- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- Edge-colorings of some large graphs on alphabets
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
- Edge colourings of embedded 1-graphs
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
- Generalised acyclic edge colourings of graphs with large girth
- List edge chromatic number of graphs with large girth
- On simultaneous colorings of embedded graphs
- Edge colorings of embedded special graphs
- Edge colourings of embedded special graphs
- Subcubic planar graphs of girth 7 are class I
- scientific article; zbMATH DE number 2192155 (Why is no real title available?)
- The entire chromatic number of graphs embedded on the torus with large maximum degree
- Strong edge-colouring of sparse planar graphs
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
This page was built for publication: Edge coloring of embedded graphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1411115)