scientific article; zbMATH DE number 3577225

zbMath0371.05015MaRDI QIDQ4146745

Carsten Thomassen

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (36)

Counterexamples to Adám's conjecture on arc reversals in directed graphs ⋮ On hyper-Hamiltonian Cartesian product of undirected cycles ⋮ Unnamed Item ⋮ Forbidden configurations for hypohamiltonian graphs ⋮ Regular Graphs with Few Longest Cycles ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ Cycle packings in graphs and digraphs ⋮ Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian ⋮ An infinite family of planar non-Hamiltonian bihomogeneously traceable oriented graphs ⋮ Highly non-concurrent longest cycles in lattice graphs ⋮ On minimum leaf spanning trees and a criticality notion ⋮ Transversals of longest cycles in partial k‐trees and chordal graphs ⋮ Planar hypohamiltonian oriented graphs ⋮ On a conjecture of Grünbaum on longest cycles ⋮ On 3‐polytopes with non‐Hamiltonian prisms ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Hypohamiltonian oriented graphs of all possible orders ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ 4-regular 4-connected Hamiltonian graphs with few Hamiltonian cycles ⋮ On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets ⋮ Intersecting longest cycles in Archimedean tilings ⋮ K₂‐Hamiltonian graphs: II ⋮ Improved bounds for hypohamiltonian graphs ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ Leaf-Critical and Leaf-Stable Graphs ⋮ On a question of van Aardt et al. on destroying all longest cycles ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ The order of hypotraceable oriented graphs ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs ⋮ On the size of maximally non-hamiltonian digraphs ⋮ Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs ⋮ On detour homogeneous digraphs ⋮ Sublinear Longest Path Transversals ⋮ $K_2$-Hamiltonian Graphs: I ⋮ Destroying longest cycles in graphs and digraphs

This page was built for publication: