Order of the smallest counterexample to Gallai's conjecture
From MaRDI portal
Publication:4568223
DOI10.21136/CMJ.2018.0422-16zbMath1488.05272WikidataQ123113724 ScholiaQ123113724MaRDI QIDQ4568223
Publication date: 15 June 2018
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Cites Work
- Intersecting longest paths
- Nonempty intersection of longest paths in series-parallel graphs
- Nonempty intersection of longest paths in a graph with a small matching number
- On longest paths and circuits in graphs.
- Longest Paths in Circular Arc Graphs
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Order of the smallest counterexample to Gallai's conjecture