Pages that link to "Item:Q5324109"
From MaRDI portal
The following pages link to Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles (Q5324109):
Displaying 9 items.
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs (Q1173768) (← links)
- Total equitable list coloring (Q1756126) (← links)
- A structural theorem for planar graphs with some applications (Q2275921) (← links)
- (Q4680036) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable (Q6660052) (← links)