On the critical difference of almost bipartite graphs
From MaRDI portal
Publication:2159389
DOI10.1007/s10801-020-00968-xzbMath1493.05233arXiv1905.09462OpenAlexW3083137321MaRDI QIDQ2159389
Vadim E. Levit, Eugen Mandrescu
Publication date: 29 July 2022
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.09462
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 (2)
On graphs admitting two disjoint maximum independent sets ⋮ On critical difference, independence number and matching number of graphs
Cites Work
- A characterization of the graphs in which the transversal number equals the matching number
- The bipartite edge frustration of composite graphs
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Combinatorial properties of the family of maximum stable sets of a graph
- Problems on matchings and independent sets of a graph
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- On the number of vertices belonging to all maximum stable sets of a graph
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Critical independent sets and König-Egerváry graphs
- On the structure of the minimum critical independent set of a graph
- Computing the bipartite edge frustration of fullerene graphs
- On \(\alpha\)-critical edges in König--Egerváry graphs
- Vertices Belonging to All Critical Sets of a Graph
- Node-weighted graphs having the König-Egerváry property
- Vertex domination-critical graphs
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
- On the core of a unicyclic graph
- On the structure of \(\alpha\)-stable graphs
This page was built for publication: On the critical difference of almost bipartite graphs
