On parsimonious edge-colouring of graphs with maximum degree three

DOI10.1007/s00373-012-1145-3zbMath1267.05117arXiv0809.4747OpenAlexW2041300856MaRDI QIDQ2376086

Jean-Luc Fouquet, Jean-Marie Vanherpe

Publication date: 26 June 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.4747

zbMATH Keywords

cubic graphedge-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ On parsimonious edge-colouring of graphs with maximum degree three ⋮ Covering a cubic graph with perfect matchings ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ On maximum \(k\)-edge-colorable subgraphs of bipartite graphs ⋮ On \(S\)-packing edge-colorings of cubic graphs ⋮ Measures of edge-uncolorability of cubic graphs ⋮ On the excessive \([m\)-index of a tree] ⋮ On Sylvester Colorings of Cubic Graphs ⋮ On \(S\)-packing edge-colorings of graphs with small edge weight ⋮ Parsimonious edge-coloring on surfaces

Cites Work

• Approximating the maximum 3-edge-colorable subgraph problem
• Classification and characterizations of snarks
• Measurements of edge-uncolorability
• Parsimonious edge coloring
• On parsimonious edge-colouring of graphs with maximum degree three
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Graphes Cubiques D'Indice Chromatique Quatre
• Maximumk-colorable subgraphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Unnamed Item

This page was built for publication: On parsimonious edge-colouring of graphs with maximum degree three