Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the number of disjoint perfect matchings of regular graphs with given edge connectivity

From MaRDI portal
Publication:729759
Jump to:navigation, search

DOI10.1016/j.disc.2016.09.002zbMath1351.05181OpenAlexW2556946628MaRDI QIDQ729759

Hongliang Lu, Yu-qing Lin

Publication date: 22 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.002


zbMATH Keywords

1-factorization conjectureedge disjoint perfect matching


Mathematics Subject Classification ID

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




Cites Work

  • Unnamed Item
  • Hamilton connected graphs
  • Factorizations of regular graphs
  • Matching theory
  • Note on Hamilton Circuits
  • Factorizations of regular graphs of high degree
  • Proof of the $1$-factorization and Hamilton Decomposition Conjectures
  • The Factorization of Linear Graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:729759&oldid=12654102"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 11:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki