Pages that link to "Item:Q4979843"
From MaRDI portal
The following pages link to Transversals of Longest Paths and Cycles (Q4979843):
Displaying 22 items.
- Detour trees (Q277622) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Well-partitioned chordal graphs (Q2144581) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Transversals of longest cycles in chordal and bounded tree-width graphs (Q2294714) (← links)
- Destroying longest cycles in graphs and digraphs (Q2345615) (← links)
- A note on longest paths in circular arc graphs (Q2516667) (← links)
- Intersecting longest paths in chordal graphs (Q2685319) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Non-empty intersection of longest paths in \(H\)-free graphs (Q2692169) (← links)
- Three problems on well-partitioned chordal graphs (Q2692718) (← links)
- Sublinear Longest Path Transversals (Q5009325) (← links)
- (Q5089236) (← links)
- Intersection of longest paths in graph classes (Q5892302) (← links)
- Intersection of longest paths in graph classes (Q5918842) (← links)
- Transversals of longest paths (Q5919333) (← links)
- Transversals of longest cycles in partial k‐trees and chordal graphs (Q6056759) (← links)
- Improved upper bounds on longest-path and maximal-subdivision transversals (Q6098097) (← links)
- Bonds Intersecting Long Paths in \(k\) -Connected Graphs (Q6098461) (← links)
