Forbidden subgraphs and the König-Egerváry property
From MaRDI portal
Publication:2444529
Recommendations
- Forbidden subgraphs and the Kőnig property
- Forbidden subgraphs and forbidden substructures
- scientific article; zbMATH DE number 4101231
- scientific article; zbMATH DE number 4144022
- scientific article; zbMATH DE number 1185308
- Forbidden subgraphs in connected graphs
- Forbidden subgraphs and graph decomposition
- The Lemmens-Seidel conjecture and forbidden subgraphs
- Publication:4862340
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
Cites work
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 3742601 (Why is no real title available?)
- scientific article; zbMATH DE number 1472162 (Why is no real title available?)
- A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
- A characterization of the graphs in which the transversal number equals the matching number
- A graph theoretical model for the total balancedness of combinatorial games
- Critical independent sets and König-Egerváry graphs
- Ear-decompositions of matching-covered graphs
- Greedoids
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Introduction to Greedoids
- König-Egerváry graphs are non-Edmonds
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Matching theory
- On local maximum stable set greedoids
- On maximum matchings in König-Egerváry graphs
- Structure analysis of some generalizations of matchings and matroids under algorithmic aspects
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- TWO THEOREMS IN GRAPH THEORY
- The critical independence number and an independence decomposition
- The strong perfect graph theorem
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
Cited in
(20)- scientific article; zbMATH DE number 4101231 (Why is no real title available?)
- Two more characterizations of König-Egerváry graphs
- On an annihilation number conjecture
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
- On König-Egerváry collections of maximum critical independent sets
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
- Forbidden subgraphs and the Kőnig property
- Forbidden subgraphs for \(k\) vertex-disjoint stars
- The Lemmens-Seidel conjecture and forbidden subgraphs
- scientific article; zbMATH DE number 1185308 (Why is no real title available?)
- Critical independent sets of König-Egerváry graphs
- Node-weighted graphs having the König-Egerváry property
- Critical and maximum independent sets of a graph
- König-Egerváry graphs are non-Edmonds
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition
- A necessary condition for EPT graphs and a new family of minimal forbidden subgraphs
- Forbidden subgraphs for collapsible graphs and supereulerian graphs
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- New results relating independence and matchings
- Regular graphs with equal matching number and independence number
This page was built for publication: Forbidden subgraphs and the König-Egerváry property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444529)
