scientific article; zbMATH DE number 3248752

MaRDI QIDQ5537559zbMATH OpenFDO

Authors

Publication date 1968

zbMATH Keywords

general mathematics

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx)

Cited in

(17)

• Spiders everywhere
• \(K_ 5\) is the only double-critical 5-chromatic graph
• Bounding the distance among longest paths in a connected graph
• Intersecting longest paths
• Gallai's question and constructions of almost hypotraceable graphs
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• All longest cycles in a 2‐connected partial 3‐tree share a common vertex
• Nontraceable detour graphs
• Nonempty intersection of longest paths in series-parallel graphs
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Efficient enumeration of graph orientations with sources
• Über längste Wege und Kreise in Graphen
• Intersecting longest paths in chordal graphs
• Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
• Order of the smallest counterexample to Gallai's conjecture
• Double-critical graph conjecture for claw-free graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5537559)