Pages that link to "Item:Q5943049"
From MaRDI portal
The following pages link to On the structure of graphs with bounded asteroidal number (Q5943049):
Displaying 11 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Tree loop graphs (Q876466) (← links)
- Feedback vertex set on AT-free graphs (Q944750) (← links)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs (Q2840688) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)