scientific article; zbMATH DE number 863469
From MaRDI portal
Publication:4871748
zbMath0849.05044MaRDI QIDQ4871748
Publication date: 5 November 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (89)
Counting Hamilton cycles in Dirac hypergraphs ⋮ A divergence-like characterization of admissible functions on digraphs ⋮ A note on a spanning 3-tree ⋮ Claw-free graphs---a survey ⋮ Regular Graphs with Few Longest Cycles ⋮ A bypassing path based routing algorithm for the pyramid structures ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ On colorful edge triples in edge-colored complete graphs ⋮ A \(k\)-tree containing specified vertices ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three ⋮ Independent dominating sets and a second hamiltonian cycle in regular graphs ⋮ Intersections of longest cycles in \(k\)-connected graphs ⋮ Chords of longest cycles in cubic graphs ⋮ On the number of cycles in 3-connected cubic graphs ⋮ A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Ádám's conjecture ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ Path decompositions of tournaments ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs ⋮ Interval degree and bandwidth of a graph ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ A Dirac theorem for trestles ⋮ On the Maximum Number of Spanning Copies of an Orientation in a Tournament ⋮ Hamilton decompositions of regular expanders: applications ⋮ The calculation of average distance in mesh structures. ⋮ Covers of Eulerian graphs ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Connectivity of \(k\)-extendable graphs with large \(k\). ⋮ \(\alpha\)-degree closures for graphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Cycles and stability ⋮ \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets ⋮ Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture ⋮ On a cyclic connectivity property of directed graphs ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ On existence theorems ⋮ Robust Hamiltonicity of Dirac graphs ⋮ On degree sum conditions for directed path-factors with a specified number of paths ⋮ Cycle double covers and spanning minors. I ⋮ Hamiltonian degree sequences in digraphs ⋮ Pancyclicity of Hamiltonian and highly connected graphs ⋮ Girth and treewidth ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ Splits of circuits ⋮ Hamilton cycles in strong products of graphs ⋮ Resolution cannot polynomially simulate compressed-BFS ⋮ The order of hypotraceable oriented graphs ⋮ Equality of graphs up to complementation ⋮ Longest path partitions in generalizations of tournaments ⋮ On a cycle partition problem ⋮ On degree sum conditions for long cycles and cycles through specified vertices ⋮ Partial cubes: Structures, characterizations, and constructions ⋮ Partitioning transitive tournaments into isomorphic digraphs ⋮ Long paths and cycles passing through specified vertices under the average degree condition ⋮ Hypomorphy of graphs up to complementation ⋮ Closure and spanning \(k\)-trees ⋮ Hamiltonicity of 3-arc graphs ⋮ A spectral lower bound for the treewidth of a graph and its consequences ⋮ A degree sum condition concerning the connectivity and the independence number of a graph ⋮ Degree condition for subdivisions of unicyclic graphs ⋮ On the domination search number ⋮ Cycle lengths in graphs with large minimum degree ⋮ Hamiltonian cycles and dominating cycles passing through a linear forest ⋮ Covering the vertices of a graph with cycles of bounded length ⋮ On pseudo 2-factors ⋮ Vertices of small degree in uniquely Hamiltonian graphs ⋮ Weakly pancyclic graphs ⋮ Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture ⋮ Dirac's Condition for Spanning Halin Subgraphs ⋮ Dirac's type sufficient conditions for hamiltonicity and pancyclicity ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ The average diameter and its estimation in nonlinear structures ⋮ The numbers of shared upper bounds determine a poset ⋮ Connected Cayley graphs of semi-direct products of cyclic groups of prime order by Abelian groups are Hamiltonian ⋮ Oriented Hamiltonian cycles in tournaments ⋮ On the number of edges of a graph and its complement ⋮ A generalization of a theorem of Dirac ⋮ Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture ⋮ The complement of the path is determined by its spectrum ⋮ A bound on the chromatic number using the longest odd cycle length ⋮ A degree sum condition for longest cycles in 3-connected graphs ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ Intersections of cycles in \(k\)-connected graphs
This page was built for publication:
