Edge-choosability in line-perfect multigraphs

DOI10.1016/S0012-365X(98)00293-3zbMath0928.05017OpenAlexW1966504604WikidataQ127829964 ScholiaQ127829964MaRDI QIDQ1301714

Douglas R. Woodall, D. L. Peterson

Publication date: 2 January 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00293-3

zbMATH Keywords

edge coloringperfect graphchromatic indexedge-choosabilityline-perfect multigraphlist chromatic indexlist-coloring conjectureperfect line graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items

List edge and list total colorings of planar graphs without 4-cycles, Asymptotically good edge correspondence colourings, The list chromatic index of simple graphs whose odd cycles intersect in at most one edge, COLORING ALGORITHMS ON SUBCUBIC GRAPHS, Structural properties and edge choosability of planar graphs without 4-cycles, Counterexamples to the List Square Coloring Conjecture, Edge choosability of planar graphs without small cycles, Choosability, edge choosability and total choosability of outerplane graphs, Two Chromatic Conjectures: One for Vertices and One for Edges, Edge-choosability of multicircuits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels in perfect line-graphs
• List edge and list total colourings of multigraphs
• The list chromatic index of a bipartite multigraph
• Normal hypergraphs and the perfect graph conjecture