The following pages link to (Q4551369):
Displaying 10 items.
- Girth and treewidth (Q707020) (← links)
- A linear time algorithm to list the minimal separators of chordal graphs (Q819826) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph (Q1985603) (← links)
- The 3-Steiner Root Problem (Q3508559) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Disconnected matchings (Q5925688) (← links)
- Disconnected matchings (Q5972267) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
