Publication:5537559
From MaRDI portal
zbMath0155.00201MaRDI QIDQ5537559
No author found.
Publication date: 1968
00B25: Proceedings of conferences of miscellaneous specific interest
05-06: Proceedings, conferences, collections, etc. pertaining to combinatorics
05Cxx: Graph theory
Related Items
Order of the smallest counterexample to Gallai's conjecture, All longest cycles in a 2‐connected partial 3‐tree share a common vertex, Intersecting longest paths, Double-critical graph conjecture for claw-free graphs, Nonempty intersection of longest paths in series-parallel graphs, Nontraceable detour graphs, \(K_ 5\) is the only double-critical 5-chromatic graph, Über längste Wege und Kreise in Graphen, Nonempty intersection of longest paths in \(2K_2\)-free graphs, Efficient enumeration of graph orientations with sources, Bounding the distance among longest paths in a connected graph, Gallai's question and constructions of almost hypotraceable graphs, Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers, Spiders everywhere, A two-connected planar graph without concurrent longest paths, Vertices missed by longest paths or circuits, Intersecting longest paths in chordal graphs