Pages that link to "Item:Q2497482"

The following pages link to Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482):

Displaying 18 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)
• On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
• Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
• An introduction to the discharging method via graph coloring (Q507506) (← links)
• A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998) (← links)
• On edge colorings of 1-planar graphs without 5-cycles with two chords (Q1717181) (← links)
• Edge colorings of planar graphs without 6-cycles with three chords (Q1746732) (← 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-partition and star chromatic index (Q2335139) (← links)
• Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779) (← links)
• A sufficient condition for a planar graph to be class I (Q2456359) (← links)
• Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
• Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
• Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable (Q6041542) (← links)