The edge chromatic difference sequence of a cubic graph

DOI10.1016/S0012-365X(96)00368-8zbMath0894.05018WikidataQ126803172 ScholiaQ126803172MaRDI QIDQ1377864

Michael O. Albertson, Ruth Haas

Publication date: 7 September 1998

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

zbMATH Keywords

cubic graphschromatic indexchromatic difference sequence

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Finding independent sets in \(K_4\)-free 4-regular connected 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 ⋮ On strongly spanning k-edge-colorable subgraphs ⋮ On disjoint matchings in cubic graphs ⋮ Measurements of edge-uncolorability

Cites Work

• Homomorphisms of 3-chromatic graphs
• Matching theory
• Brooks' graph-coloring theorem and the independence number
• The chromatic difference sequence of a graph
• Parsimonious edge coloring
• Unnamed Item
• Unnamed Item

This page was built for publication: The edge chromatic difference sequence of a cubic graph