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