Publication:3199444
From MaRDI portal
zbMath0714.05037MaRDI QIDQ3199444
Sandi Klavžar, Marko Petkovsek
Publication date: 1990
cycle; split graph; intersection; longest paths; Hamilton-connected; almost-Hamilton-connected; block of a graph
Related Items
Order of the smallest counterexample to Gallai's conjecture, Intersection of longest paths in graph classes, Intersection of longest paths in graph classes, Transversals of longest paths, Bonds Intersecting Long Paths in \(k\) -Connected Graphs, Intersecting longest cycles in Archimedean tilings, Detour trees, Intersecting longest paths, Nonempty intersection of longest paths in series-parallel graphs, Nonempty intersection of longest paths in \(2K_2\)-free graphs, Bounding the distance among longest paths in a connected graph, Gallai's question and constructions of almost hypotraceable graphs, Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs, Well-partitioned chordal graphs, Nonempty intersection of longest paths in graphs without forbidden pairs, Intersecting longest paths in chordal graphs, Non-empty intersection of longest paths in \(H\)-free graphs, Three problems on well-partitioned chordal graphs, Unnamed Item