Pages that link to "Item:Q5902513"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5902513):
Displaying 10 items.
- On cuts and matchings in planar graphs (Q688915) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Decycling with a matching (Q2628271) (← links)
- Discontinuities in the complexities of some graph recognition problems (Q2848780) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- Matching cutsets in graphs (Q5203060) (← links)