Pages that link to "Item:Q1825210"
From MaRDI portal
The following pages link to König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210):
Displaying 26 items.
- When is \(G^2\) a König-Egerváry graph? (Q367094) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
- Critical independent sets and König-Egerváry graphs (Q1926061) (← links)
- Regular graphs with equal matching number and independence number (Q2074360) (← links)
- New results relating independence and matchings (Q2151222) (← links)
- On the critical difference of almost bipartite graphs (Q2159389) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Some more updates on an annihilation number conjecture: pros and cons (Q2164992) (← links)
- Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number (Q2231756) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- On \(\alpha\)-critical edges in König--Egerváry graphs (Q2502896) (← links)
- Berge's theorem for the maximum charge problem (Q2506824) (← links)
- The price of defense (Q2663706) (← links)
- A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph (Q3655146) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- A classification of 1-well-covered graphs (Q5097748) (← links)
