Pathwidth
flowchart AA["Associated Authors (0)"] C[Pathwidth] BC["Broader Concepts (1)"] NC["Narrower Concepts (36)"] C== skos:broader ==>BC NC== skos:broader ==>C AA== dcterms:relation ==>C click BC "#broader-concepts" click NC "#narrower-concepts" click AA "#associated-authors" NI["add incoming edge"] NO["add outgoing edge"] NI-- ? -->C C-- ? -->NO click NI "#add-incoming-edge" click NO "#add-outgoing-edge" style NI stroke-width:2px,stroke-dasharray: 5 5 style NO stroke-width:2px,stroke-dasharray: 5 5
- Wikidata
- https://www.wikidata.org/wiki/Q7144893
- OpenAlex ID
- https://openalex.org/C43517604 (API record)
- OpenAlex Description
- term in graph theory
- OpenAlex Level [?]
- 4
Broader Concepts
Narrower Concepts
- Block graph
- Book embedding
- Circle graph
- Clique problem
- Clique-sum
- Cograph
- Comparability graph
- Dense graph
- Graph product
- Hopcroft–Karp algorithm
- Induced path
- Interval graph
- Maximal independent set
- Metric dimension
- Modular decomposition
- Odd graph
- Outerplanar graph
- Pancyclic graph
- Partial k-tree
- Perfect graph
- Perfect graph theorem
- Planar straight-line graph
- Polyhedral graph
- Random regular graph
- Robertson–Seymour theorem
- Split graph
- Strong perfect graph theorem
- Strongly regular graph
- Topological graph theory
- Trapezoid graph
- Tree decomposition
- Tree-depth
- Treewidth
- Triangle-free graph
- Trivially perfect graph
- Trémaux tree
Associated Authors
Add Incoming Edge
Login via ORCiD to contribute.
Add Outgoing Edge
Login via ORCiD to contribute.