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

Minimal 2-matching-covered graphs

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

DOI10.1016/j.disc.2009.01.005zbMath1218.05158OpenAlexW2037607578MaRDI QIDQ1043944

Shan Zhou, Heping Zhang

Publication date: 10 December 2009

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

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


zbMATH Keywords

perfect 2-matching2-matching-covered graphminimal 2-matching-covered graph


Mathematics Subject Classification ID

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


Related Items (2)

Nearly symmetric-indecomposable matrices ⋮ Bipartite double cover and perfect 2-matching covered graph with its algorithm



Cites Work

  • Unnamed Item
  • Matching theory
  • A matching problem with side conditions
  • On minimal elementary bipartite graphs
  • Regularisable graphs I
  • Finding maximum square-free 2-matchings in bipartite graphs
  • The Factors of Graphs




This page was built for publication: Minimal 2-matching-covered graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1043944&oldid=13059209"
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 23:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki