Some more updates on an annihilation number conjecture: pros and cons
From MaRDI portal
Publication:2164992
DOI10.1007/s00373-022-02534-7zbMath1496.05130OpenAlexW4290861007WikidataQ113905201 ScholiaQ113905201MaRDI QIDQ2164992
Vadim E. Levit, Eugen Mandrescu
Publication date: 18 August 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02534-7
treebipartite graphmatchingmaximum independent setKönig-Egerváry graphannihilation numberannihilation set
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of the graphs in which the transversal number equals the matching number
- The critical independence number and an independence decomposition
- Graphs with equal independence and annihilation numbers
- Ear-decompositions of matching-covered graphs
- Graphs with unique maximum independent sets
- Matching theory
- Testing for Equality between Maximum Matching and Minimum Node Covering
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Bounding the locating-total domination number of a tree in terms of its annihilation number
- Hall's and Kőnig's theorem in graphs and hypergraphs
- Relating the annihilation number and the 2-domination number of block graphs
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Critical independent sets and König-Egerváry graphs
- Relating the annihilation number and the total domination number of a tree
- Critical sets, crowns and local maximum independent sets
- The annihilation number does not bound the 2-domination number from the above
- The annihilation number and the total domination number of a tree-like graph
- On maximum matchings in König-Egerváry graphs
- On some conjectures concerning critical independent sets of a graph
- Bounding the paired-domination number of a tree in terms of its annihilation number
- A remark on the existence of finite graphs
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
- Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems
- On an annihilation number conjecture
- On König-Egerváry collections of maximum critical independent sets
- Relating the total domination number and the annihilation number of cactus graphs and block graphs
