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

DOI10.1016/0012-365X(89)90082-4MaRDI QIDQ1121901zbMATH OpenOpenAlexWikidataFDO

Authors Amanda G. Chetwynd, A. 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 graphs1-factorizationchromatic indexedge-colouring

Mathematics Subject Classification ID

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

Recommendations

• Regular Graphs of High Degree are 1-Factorizable
• An application of Tutte's theorem to 1-factorization of regular graphs of high degree
• Number of 1-factorizations of regular high-degree graphs
• Factorizations of regular graphs of high degree
• scientific article; zbMATH DE number 1990720

Cites work

• scientific article; zbMATH DE number 3428958 (Why is no real title available?)
• A \(\Delta\)-subgraph condition for a graph to be class 1
• Class one graphs
• On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
• Regular Graphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs

Cited in

(34)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121901)