Pages that link to "Item:Q1746732"
From MaRDI portal
The following pages link to Edge colorings of planar graphs without 6-cycles with three chords (Q1746732):
Displaying 15 items.
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- Edge colorings of planar graphs without 5-cycles with two chords (Q391789) (← links)
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998) (← links)
- Remarks on planar edge-chromatic critical graphs (Q906449) (← links)
- Edge coloring of planar graphs without adjacent 7-cycles (Q1643159) (← links)
- A sufficient condition for a plane graph with maximum degree 6 to be class 1 (Q1759890) (← links)
- Planar graphs of maximum degree seven are Class I (Q1850561) (← links)
- The edge colorings of \(K_5\)-minor free graphs (Q2022144) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029) (← links)
- Structural properties and edge choosability of planar graphs without 6-cycles (Q2731587) (← links)
- Edge colorings of planar graphs without adjacent special cycles. (Q2839908) (← links)
- (Q4684518) (← links)
