The following pages link to (Q4014299):
Displaying 20 items.
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- On resolving edge colorings in graphs (Q1415146) (← links)
- Some results on an edge coloring problem of Folkman and Fulkerson (Q1587594) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- On edge orienting methods for graph coloring (Q2385485) (← links)
- Reachability problems in edge-colored digraphs (Q2643322) (← links)
- Some results on edge-colourings of graphs (Q2712481) (← links)
- Edge-colorings of some large graphs on alphabets (Q2713603) (← links)
- Edge colourings of embedded 1-graphs (Q2823372) (← links)
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
- Edge-Coloring and f-Coloring for Various Classes of Graphs (Q4243441) (← links)
- (Q4504893) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- Some arithmetical restatements of the four color conjecture (Q5941259) (← links)