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