Forbidden subgraphs and the König-Egerváry property
DOI10.1016/J.DAM.2013.04.020zbMATH Open1285.05127OpenAlexW2034045334MaRDI QIDQ2444529FDOQ2444529
Authors: Mitre C. Dourado, Guillermo Durán, Luciano N. Grippo, Martín D. Safe, Flavia Bonomo, Luerbio Faria 
Publication date: 10 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.04.020
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
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Ear-decompositions of matching-covered graphs
- Matching theory
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Title not available (Why is that?)
- Introduction to Greedoids
- The strong perfect graph theorem
- TWO THEOREMS IN GRAPH THEORY
- Critical independent sets and König-Egerváry graphs
- On maximum matchings in König-Egerváry graphs
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- A characterization of the graphs in which the transversal number equals the matching number
- The critical independence number and an independence decomposition
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- Title not available (Why is that?)
- Title not available (Why is that?)
- On local maximum stable set greedoids
- Greedoids
- König-Egerváry graphs are non-Edmonds
- Structure analysis of some generalizations of matchings and matroids under algorithmic aspects
- A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
- A graph theoretical model for the total balancedness of combinatorial games
Cited In (20)
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
