Regular Graphs of High Degree are 1-Factorizable
From MaRDI portal
Recommendations
- Regular Multigraphs of High Degree are 1-Factorizable
- Number of 1-factorizations of regular high-degree graphs
- All regular multigraphs of even order and high degree are 1-factorable
- Factorizations of regular graphs of high degree
- 1-factorizing regular graphs of high degree - an improved bound
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree
- Vertex-regular 1-factorizations of the complete graph
- Regular factors of regular graphs
- Regular factors in regular graphs
- Regular factors in nearly regular graphs
Cited in
(50)- An application of Tutte's theorem to 1-factorization of regular graphs of high degree
- A \(\Delta\)-subgraph condition for a graph to be class 1
- The edge-chromatic class of regular graphs of degree 4 and their complements
- Critical star multigraphs
- Recent progress on edge-colouring graphs
- 1-factorizing regular graphs of high degree - an improved bound
- Two conjectures on edge-colouring
- The spectrum of maximal sets of one-factors
- The chromatic index of a graph whose core has maximum degree two
- The chromatic index of graphs of high maximum degree
- Edge coloring regular graphs of high degree
- Vertex-splitting and chromatic index critical graphs
- 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\)
- More on the rainbow disconnection in graphs
- Number of 1-factorizations of regular high-degree graphs
- Edge-colouring of join graphs
- Edge-colouring of regular graphs of large degree
- (r,r+1)-factorizations of (d,d+1)-graphs
- Equitable edge-colorings of simple graphs
- scientific article; zbMATH DE number 3851151 (Why is no real title available?)
- The chromatic index of strongly regular graphs
- On the Maximum Edge Coloring Problem
- On the size of graphs of class 2 whose cores have maximum degree two
- One-factorizations of the complete graph—A survey
- Factorizations of regular graphs of high degree
- Graphs which are vertex-critical with respect to the edge-chromatic number
- Regular Multigraphs of High Degree are 1-Factorizable
- scientific article; zbMATH DE number 1990720 (Why is no real title available?)
- Coloring edges of embedded graphs
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
- Isomorphic factorizations X: Unsolved problems
- An asymptotic version of the multigraph 1-factorization conjecture
- The number of disjoint perfect matchings in semi-regular graphs
- Proof of the 1-factorization and Hamilton Decomposition Conjectures
- All regular multigraphs of even order and high degree are 1-factorable
- Latin hexahedra and related combinatorial structures
- Maximally edge‐connected realizations and Kundu's k k‐factor theorem
- Tight bounds on the chromatic edge stability index of graphs
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
- On a conjecture that strengthens Kundu's k-factor theorem
- A note on Hamilton decompositions of even-regular multigraphs
- A sufficient condition for complete multipartite graphs to be of type 1
- Graph products that allow two distinct eigenvalues
- Beyond leagues: a single incomplete round Robin tournament for multi-league sports timetabling
- On the multigraph overfull conjecture
- Towards the overfull conjecture
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- Approximating the max-edge-coloring problem
This page was built for publication: Regular Graphs of High Degree are 1-Factorizable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5184935)
