The following pages link to (Q5537559):
Displayed 17 items.
- Intersecting longest paths (Q389499) (← links)
- Double-critical graph conjecture for claw-free graphs (Q526254) (← links)
- Nonempty intersection of longest paths in series-parallel graphs (Q729758) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- \(K_ 5\) is the only double-critical 5-chromatic graph (Q1088672) (← links)
- Über längste Wege und Kreise in Graphen (Q1225628) (← links)
- Nonempty intersection of longest paths in \(2K_2\)-free graphs (Q1640209) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- Bounding the distance among longest paths in a connected graph (Q1699570) (← links)
- Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
- Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers (Q2075527) (← links)
- Spiders everywhere (Q2217501) (← links)
- A two-connected planar graph without concurrent longest paths (Q2554342) (← links)
- Vertices missed by longest paths or circuits (Q2560260) (← links)
- Intersecting longest paths in chordal graphs (Q2685319) (← links)
- Order of the smallest counterexample to Gallai's conjecture (Q4568223) (← links)
- All longest cycles in a 2‐connected partial 3‐tree share a common vertex (Q6047958) (← links)