The number of disjoint perfect matchings in semi-regular graphs

DOI10.2298/AADM161109030LzbMATH Open1499.05522MaRDI QIDQ5034273FDOQ5034273

Authors: Hongliang Lu, David G. L. Wang 

Publication date: 24 February 2022

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

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

zbMATH Keywords

factorizationperfect matchingregular graphHamiltonian graphsemiregular graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)