Pages that link to "Item:Q5941505"
From MaRDI portal
The following pages link to A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs (Q5941505):
Displayed 11 items.
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Finding a minimum path cover of a distance-hereditary graph in polynomial time (Q2457005) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Computing maximum stable sets for distance-hereditary graphs (Q2568337) (← links)
- Distance-Hereditary Comparability Graphs (Q2840542) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)