Pages that link to "Item:Q1052341"
From MaRDI portal
The following pages link to Ear-decompositions of matching-covered graphs (Q1052341):
Displaying 38 items.
- Faces of Birkhoff Polytopes (Q161295) (← links)
- Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs (Q328720) (← links)
- Matching covered graphs with three removable classes (Q405203) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- Removable ears of 1-extendable graphs (Q601904) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- A characterization of minimal non-Seymour graphs (Q898107) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Matching extension and the genus of a graph (Q1107545) (← links)
- \(k\)-cycle resonant graphs (Q1343255) (← links)
- Planar \(k\)-cycle resonant graphs with \(k=1,2\) (Q1406034) (← links)
- Reducible chains of planar 1-cycle resonant graphs (Q1420593) (← links)
- Critical and maximum independent sets of a graph (Q1671323) (← links)
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings (Q1825210) (← links)
- Reduced 2-to-1 maps and decompositions of graphs with no 2-to-1 cut sets (Q1862028) (← links)
- Critical independent sets of König-Egerváry graphs (Q2146733) (← 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 essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- On approximability of optimization problems related to red/blue-split graphs (Q2399618) (← links)
- Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
- Ear decomposition and induced even cycles (Q2422747) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- On maximum matchings in König-Egerváry graphs (Q2446347) (← links)
- Minimal bricks (Q2496202) (← links)
- On \((g,f)\)-uniform graphs (Q2577646) (← links)
- On some conjectures concerning critical independent sets of a graph (Q2629485) (← links)
- <i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs (Q2811192) (← links)
- Forbidden subgraphs and the Kőnig property (Q2840731) (← links)
- A characterization of Konig-Egervary graphs using a common property of all maximum matchings (Q2857406) (← links)
- On Two Unsolved Problems Concerning Matching Covered Graphs (Q3174694) (← links)
- Even cycles and perfect matchings in claw-free plane graphs (Q3386627) (← links)
- WELL-COVERED GRAPHS: A SURVEY (Q4288045) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
- Removable edges in Halin graphs (Q6130202) (← links)
- On critical difference, independence number and matching number of graphs (Q6133662) (← links)
- Removable Edges in Claw-Free Bricks (Q6489354) (← links)
