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