A note on \({\mathtt V}\)-free 2-matchings
From MaRDI portal
Publication:727204
zbMath1351.05195arXiv1505.03717MaRDI QIDQ727204
Máté Vizer, Attila Bernáth, Kristóf Bérczi
Publication date: 6 December 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.03717
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Regular graphs are antimagic
- Maximum cardinality 1-restricted simple 2-matchings
- General factors of graphs
- Matching theory
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
- Packing paths of length at least two
- Antimagic Labeling of Regular Graphs
- Coverings of Bipartite Graphs
- Path and cycle factors of cubic bipartite graphs
- Path factors in cubic graphs
- The Nonnegative Node Weight j-Restricted k-Matching Problems
- The k‐piece packing problem
This page was built for publication: A note on \({\mathtt V}\)-free 2-matchings
