Pages that link to "Item:Q1411115"
From MaRDI portal
The following pages link to Edge coloring of embedded graphs with large girth (Q1411115):
Displaying 13 items.
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← links)
- On simultaneous colorings of embedded graphs (Q1586769) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029) (← links)
- The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264) (← links)
- Edge-colorings of some large graphs on alphabets (Q2713603) (← links)
- Edge colourings of embedded 1-graphs (Q2823372) (← links)
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)