Regular Graphs of High Degree are 1-Factorizable
From MaRDI portal
Publication:5184935
DOI10.1112/plms/s3-50.2.193zbMath0561.05027OpenAlexW2011280458WikidataQ29396972 ScholiaQ29396972MaRDI QIDQ5184935
Amanda G. Chetwynd, Anthony J. W. Hilton
Publication date: 1985
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-50.2.193
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
The number of disjoint perfect matchings in semi-regular graphs, Proof of the 1-factorization and Hamilton Decomposition Conjectures, Edge-colouring of join graphs, 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, One-factorizations of the complete graph—A survey, 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, More on the rainbow disconnection in graphs, On the size of graphs of class 2 whose cores have maximum degree two, Total chromatic number of regular graphs of odd order and high degree, 1-factorizing regular graphs of high degree - an improved bound, Two conjectures on edge-colouring, Graphs which are vertex-critical with respect to the edge-chromatic number, 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, Properties, proved and conjectured, of Keller, Mycielski, and queen graphs, Optimal path and cycle decompositions of dense quasirandom graphs, Graph edge coloring: a survey, The spectrum of maximal sets of one-factors, Edge-colouring of regular graphs of large degree, \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs, An Asymptotic Version of the Multigraph 1‐Factorization Conjecture, The chromatic index of a graph whose core has maximum degree two, Approximating the max-edge-coloring problem, Coloring edges of embedded graphs, On the Maximum Edge Coloring Problem, Equitable edge-colorings of simple graphs, The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small, The chromatic index of strongly regular graphs, Isomorphic factorizations X: Unsolved problems, An application of Tutte's theorem to 1-factorization of regular graphs of high degree
