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

Neighborhood unions and factor critical graphs

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

DOI10.1016/S0012-365X(99)00104-1zbMath0934.05102OpenAlexW2135972039MaRDI QIDQ1301846

Hikoe Enomoto, Akira Saito, Michael D. Plummer

Publication date: 9 April 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00104-1


zbMATH Keywords

independent setneighborhood unionperfect matching\(n\)-extendable\(n\)-factor critical


Mathematics Subject Classification ID

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


Related Items (2)

Path factors and neighborhoods of independent sets in graphs ⋮ Some sufficient conditions for path-factor uniform graphs




Cites Work

  • Neighbourhood unions and Hamiltonian properties in graphs
  • On k-factor-critical graphs
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Neighborhood unions and factor critical graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1301846&oldid=13412865"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki