Pages that link to "Item:Q391789"
From MaRDI portal
The following pages link to Edge colorings of planar graphs without 5-cycles with two chords (Q391789):
Displaying 16 items.
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
- Edge coloring of planar graphs without adjacent 7-cycles (Q1643159) (← links)
- On edge colorings of 1-planar graphs without 5-cycles with two chords (Q1717181) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- Edge colorings of planar graphs without 6-cycles with three chords (Q1746732) (← links)
- The edge colorings of \(K_5\)-minor free graphs (Q2022144) (← 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)
- Edge colorings of planar graphs without adjacent special cycles. (Q2839908) (← links)
- Edge colorings of planar graphs with maximum degree five. (Q2881256) (← links)
- A sufficient condition for a planar graph of maximum degree five to be class 1 (Q2916330) (← links)
- Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results (Q3188669) (← links)
- Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
- (Q4926119) (← links)
