1-factorizing regular graphs of high degree - an improved bound

DOI10.1016/0012-365X(89)90082-4zbMath0675.05030OpenAlexW2048300035WikidataQ59233634 ScholiaQ59233634MaRDI QIDQ1121901

Amanda G. Chetwynd, Anthony J. W. Hilton

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90082-4

zbMATH Keywords

regular graphsedge-colouringchromatic index1-factorization

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 (28)

The number of disjoint perfect matchings in semi-regular graphs ⋮ How to find overfull subgraphs in graphs with large maximum degree ⋮ Proof of the 1-factorization and Hamilton Decomposition Conjectures ⋮ The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ The chromatic index of graphs of high maximum degree ⋮ Edge coloring regular graphs of high degree ⋮ Vertex-splitting and chromatic index critical graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Total chromatic number of regular graphs of odd order and high degree ⋮ Two conjectures on edge-colouring ⋮ On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs ⋮ Factorization of regular multigraphs into regular graphs ⋮ Edge coloring graphs with large minimum degree ⋮ Graph divisible designs and packing constructions ⋮ Matching divisible designs with block size four ⋮ Latin hexahedra and related combinatorial structures ⋮ Some criteria for a graph to be class 1 ⋮ Grooming for two-period optical networks ⋮ Graph edge coloring: a survey ⋮ The chromatic index of a graph whose core has maximum degree two ⋮ Recent results on the total chromatic number ⋮ The chromatic index of a graph whose core is a cycle of order at most 13 ⋮ An application of Tutte's theorem to 1-factorization of regular graphs of high degree ⋮ Regular factors of simple regular graphs and factor-spectra ⋮ Total chromatic number of graphs of odd order and high degree ⋮ Totally critical even order graphs ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles ⋮ The chromatic index of a claw-free graph whose core has maximum degree 2

Cites Work

• Unnamed Item
• On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
• A \(\Delta\)-subgraph condition for a graph to be class 1
• Class one graphs
• Regular Graphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs

This page was built for publication: 1-factorizing regular graphs of high degree - an improved bound