On the core of a unicyclic graph

DOI10.26493/1855-3974.201.6e1zbMath1258.05096arXiv1102.4727OpenAlexW2106533361MaRDI QIDQ4906181

Vadim E. Levit, Eugen Mandrescu

Publication date: 7 February 2013

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.4727

zbMATH Keywords

matchingcoremaximum independent setunicyclic graphKönig-Egerváry graph.

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ On the critical difference of almost bipartite graphs ⋮ Critical and maximum independent sets of a graph ⋮ On local maximum stable set greedoids ⋮ On the intersection of all critical sets of a unicyclic graph ⋮ Monotonic properties of collections of maximum independent sets of a graph

This page was built for publication: On the core of a unicyclic graph