Pages that link to "Item:Q5897545"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q5897545):
Displaying 9 items.
- Well-quasi-order of relabel functions (Q603891) (← links)
- Characterizations for co-graphs defined by restricted NLC-width or clique-width operations (Q819817) (← links)
- A local characterization of bounded clique-width for line graphs (Q868337) (← links)
- Characterizations for restricted graphs of NLC-width 2 (Q870845) (← links)
- On a disparity between relative cliquewidth and relative NLC-width (Q972344) (← links)
- Line graphs of bounded clique-width (Q2461201) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- Vertex disjoint paths on clique-width bounded graphs (Q2503296) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
