The number of disjoint perfect matchings in semi-regular graphs

DOI10.2298/AADM161109030LMaRDI QIDQ5034273zbMATH OpenFDO

Authors Hongliang Lu, David G. L. Wang

Publication date 24 February 2022

Published in Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

factorizationperfect matchingregular graphHamiltonian graphsemiregular graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• On the perfect matchings of near regular graphs
• scientific article; zbMATH DE number 2104839
• Maximum matchings in a regular graph of specified connectivity and bounded order
• Perfect matchings in regular bipartite graphs

Cites work

• scientific article; zbMATH DE number 15875 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• 1-factorizing regular graphs of high degree - an improved bound
• A remark on the factor theorems of lovász and tutte
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Edge coloring regular graphs of high degree
• Edge-colouring of join graphs
• Edge-colouring of regular graphs of large degree
• Factorizations of regular graphs
• Factorizations of regular graphs of high degree
• Factors and factorizations of graphs. Proof techniques in factor theory
• Hamilton connected graphs
• Matching theory
• Note on Hamilton Circuits
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• On the perfect matchings of near regular graphs
• Regular Graphs of High Degree are 1-Factorizable
• Regular Multigraphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs
• The Factorization of Linear Graphs
• The NP-Completeness of Edge-Coloring
• The chromatic index of complete multipartite graphs
• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small

Cited in

(5)

• scientific article; zbMATH DE number 2104839 (Why is no real title available?)
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• On the perfect matchings of near regular graphs
• Disjoint stable matchings in linear time
• scientific article; zbMATH DE number 1792647 (Why is no real title available?)

This page was built for publication: The number of disjoint perfect matchings in semi-regular graphs

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