The following pages link to (Q3836524):
Displaying 13 items.
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Generating and counting unlabeled \(k\)-path graphs (Q496683) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- On exploring always-connected temporal graphs of small pathwidth (Q1628692) (← links)
- On the classes of interval graphs of limited nesting and count of lengths (Q1739103) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- \(k\)-paths of \(k\)-trees (Q2089555) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Long induced paths in minor-closed graph classes and beyond (Q2684889) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- Preferences Single-Peaked on a Tree: Multiwinner Elections and Structural Results (Q5026258) (← links)
