Recommendations
Cites work
- 25 pretty graph colouring problems
- Edge-choosability in line-perfect multigraphs
- Kernels in perfect line-graphs
- List edge and list total colourings of multigraphs
- On kernel-perfect orientations of line graphs
- Some upper bounds on the total and list chromatic numbers of multigraphs
- The list chromatic index of a bipartite multigraph
Cited in
(21)- List edge and list total coloring of planar graphs without intersecting 8-cycles
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
- Edge choosability of planar graphs without small cycles
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- Edge-choosability of planar graphs without non-induced 5-cycles
- List edge and list total colorings of planar graphs without 4-cycles
- A relation between choosability and uniquely list colorability
- Structural properties and edge choosability of planar graphs without 4-cycles
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
- Choosability, edge choosability and total choosability of outerplane graphs
- Two Chromatic Conjectures: One for Vertices and One for Edges
- List edge coloring of planar graphs without non-induced 6-cycles
- Edge-group choosability of outerplanar and near-outerplanar graphs
- List edge colorings of planar graphs without adjacent 7-cycles
- Choosability conjectures and multicircuits
- Orientations of graphs with prescribed weighted out-degrees
- Counterexamples to the list square coloring conjecture
- Edge choosability of planar graphs without 5-cycles with a chord
- List-edge-coloring of planar graphs without 6-cycles with three chords
- Total choosability of multicircuits I
- Total choosability of multicircuits II
This page was built for publication: Edge-choosability of multicircuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1301722)
