1-factorizing regular graphs of high degree - an improved bound
From MaRDI portal
The authors improve their previous results concerning 1-factorization of regular graphs of even order. Let G be a regular graph of even order and degree d(G). In their paper ``Regular graphs of high degree are 1- factorizable, Proc. Lond. Math. Soc., III. Ser. 50, 193-206 (1985; Zbl 0561.05027) the authors proved that if d(G)\(\geq (6/7)| V(G)|\) the G has a 1-factorization. In this paper they improve the bound to d(G)\(\geq (\sqrt{7}-1)| V(G)|\) which is slightly better than (5/6)\(| V(G)|\).
Recommendations
Cites work
- A \(\Delta\)-subgraph condition for a graph to be class 1
- Class one graphs
- scientific article; zbMATH DE number 3428958 (Why is no real title available?)
- 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
(36)- An application of Tutte's theorem to 1-factorization of regular graphs of 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
- The chromatic index of a graph whose core has maximum degree two
- Total chromatic number of graphs of odd order and high degree
- Totally critical even order graphs
- How to find overfull subgraphs in graphs with large maximum degree
- The chromatic index of graphs of high maximum degree
- Edge coloring regular graphs of high degree
- Vertex-splitting and chromatic index critical graphs
- Regular factors of simple regular graphs and factor-spectra
- Graph edge coloring: a survey
- Total chromatic number of regular graphs of odd order and high degree
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
- Number of 1-factorizations of regular high-degree graphs
- The chromatic index of a claw-free graph whose core has maximum degree 2
- Grooming for two-period optical networks
- Factorizations of regular graphs of high degree
- Factorization of regular multigraphs into regular graphs
- Some criteria for a graph to be class 1
- The number of disjoint perfect matchings in semi-regular graphs
- Regular Graphs of High Degree are 1-Factorizable
- Decomposing graphs of high minimum degree into 4-cycles
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- All regular multigraphs of even order and high degree are 1-factorable
- Edge coloring graphs with large minimum degree
- Latin hexahedra and related combinatorial structures
- Tight factorizations of girth-4-regular graphs
- Tight factorizations of girth-3-regular graphs
- Recent results on the total chromatic number
- A sufficient condition for complete multipartite graphs to be of type 1
- Towards the overfull conjecture
- The chromatic index of a graph whose core is a cycle of order at most 13
- Graph factors and factorization: 1985--2003: a survey
- Graph divisible designs and packing constructions
- Matching divisible designs with block size four
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)
