List edge colourings of some 1-factorable multigraphs
From MaRDI portal
Publication:2563511
DOI10.1007/BF01261320zbMath0860.05035MaRDI QIDQ2563511
Luis A. Goddyn, Mark N. Ellingham
Publication date: 13 April 1997
Published in: Combinatorica (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (21)
Graph polynomials and paintability of plane graphs ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ Total choosability of multicircuits II ⋮ Jacobsthal numbers in generalised Petersen graphs ⋮ List Ramsey numbers ⋮ Transformation invariance in the combinatorial Nullstellensatz and nowhere-zero points of non-singular matrices ⋮ Jacobsthal Numbers in Generalized Petersen Graphs ⋮ Edge-colouring graphs with local list sizes ⋮ The list-chromatic index of \(K_6\) ⋮ Computing the list chromatic index of graphs ⋮ Edge-coloring almost bipartite multigraphs ⋮ Unnamed Item ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ Pfaffian labelings and signs of edge colorings ⋮ Parity, Eulerian subgraphs and the Tutte polynomial ⋮ Proof of the list edge coloring conjecture for complete graphs of prime degree ⋮ Some results on \((a:b)\)-choosability ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Choosability, edge choosability and total choosability of outerplane graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges
Cites Work
- Independence numbers of graphs and generators of ideals
- A new upper bound for the list chromatic number
- On the Penrose number of cubic diagrams
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- Binary invariants and orientations of graphs
- The number of edge 3-colorings of a planar cubic graph as a permanent
- The list chromatic index of a bipartite multigraph
- A note on list-colorings
- Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
- Unnamed Item
- Unnamed Item
This page was built for publication: List edge colourings of some 1-factorable multigraphs
