Parsimonious edge coloring
From MaRDI portal
Publication:1910535
DOI10.1016/0012-365X(94)00254-GzbMath0845.05036MaRDI QIDQ1910535
Ruth Haas, Michael O. Albertson
Publication date: 24 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (12)
Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ On parsimonious edge-colouring of graphs with maximum degree three ⋮ Maximum Δ-edge-colorable subgraphs of class II graphs ⋮ The edge chromatic difference sequence of a cubic graph ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ Decomposition of class II graphs into two class I graphs ⋮ On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ On disjoint matchings in cubic graphs ⋮ Measurements of edge-uncolorability ⋮ Parsimonious edge-coloring on surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Tutte's extension of the four-colour problem
- Five-coloring maps on surfaces
- Short Proof of a Map-Colour Theorem
- Largest bipartite subgraphs in triangle-free graphs with maximum degree three
- Maximumk-colorable subgraphs
- Extremal bipartite subgraphs of cubic triangle-free graphs
This page was built for publication: Parsimonious edge coloring
