A condition for a graph to contain \(k\)-matching.

DOI10.1016/S0012-365X(03)00299-1zbMath1041.05065OpenAlexW1993769788MaRDI QIDQ1422440

Adam Paweł Wojda

Publication date: 14 February 2004

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

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

zbMATH Keywords

matchingforest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots. ⋮ Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups

Cites Work

• On maximal paths and circuits of graphs
• Hamiltonian shortage, path partitions of vertices, and matchings in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A condition for a graph to contain \(k\)-matching.