Pages that link to "Item:Q1301722"
From MaRDI portal
The following pages link to Edge-choosability of multicircuits (Q1301722):
Displaying 19 items.
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- Edge choosability of planar graphs without 5-cycles with a chord (Q1025481) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- Edge choosability of planar graphs without small cycles (Q1827800) (← links)
- Choosability, edge choosability and total choosability of outerplane graphs (Q1840829) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Total choosability of multicircuits I (Q4537554) (← links)
- Counterexamples to the List Square Coloring Conjecture (Q4982285) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
