The number of disjoint perfect matchings in semi-regular graphs

DOI10.2298/AADM161109030LzbMath1499.05522MaRDI QIDQ5034273

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

factorizationHamiltonian graphregular graphperfect matchingsemiregular graph

Mathematics Subject Classification ID

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

Related Items (1)

Disjoint stable matchings in linear time

Cites Work

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

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