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

Partition the vertices of a graph into induced matchings

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

DOI10.1016/S0012-365X(02)00791-4zbMath1014.05055OpenAlexW2044057917MaRDI QIDQ1869233

Jinjiang Yuan, Qin Wang

Publication date: 9 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00791-4


zbMATH Keywords

partitioncolouringperfect matchinginduced matching


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)


Related Items (3)

Induced star partition of graphs ⋮ Unnamed Item ⋮ Partition a graph with small diameter into two induced matchings




This page was built for publication: Partition the vertices of a graph into induced matchings

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