The following pages link to A note on graphs of class I (Q1869228):
Displaying 16 items.
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- Class I graphs of nonnegative characteristic without special cycles (Q377914) (← 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)
- Edge coloring of planar graphs without adjacent 7-cycles (Q1643159) (← links)
- Edge colorings of planar graphs without 6-cycles with three chords (Q1746732) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← 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 coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779) (← links)
- Bounds on directed star arboricity in some digraph classes (Q2413182) (← links)
- A sufficient condition for a planar graph to be class I (Q2456359) (← links)
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
- A note on class one graphs with maximum degree six (Q2497484) (← links)
- Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
