Some Theorems on Abstract Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Ore-type versions of Brooks' theorem
- A new sufficient condition for Hamiltonian graphs
- Pancyclic graphs and linear forests
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Dirac-type generalizations concerning large cycles in graphs
- Hamilton cycles in claw-heavy graphs
- Path transferability of graphs with bounded minimum degree
- Triangle packings and 1-factors in oriented graphs
- On the spanning fan-connectivity of graphs
- Structure and recognition of graphs with no 6-wheel subdivision
- The Ramsey numbers for cycles versus wheels of even order
- On Hamiltonian cycles and Hamiltonian paths
- The total chromatic number of regular graphs of high degree
- Traceability of line graphs
- Trees through specified vertices
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity
- Ore-type and Dirac-type theorems for matroids
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree
- Ore-type conditions implying 2-factors consisting of short cycles
- Hamiltonicity in vertex envelopes of plane cubic graphs
- A look at cycles containing specified elements of a graph
- Weighted degrees and heavy cycles in weighted graphs
- Proof of a conjecture of Haeggkvist on cycles and independent edges
- Long cycles generate the cycle space of a graph
- Long cycles in bipartite graphs
- A generalization of Dirac's theorem
- On a conjecture of Bondy
- Longest cycles in regular graphs
- Minimum degree of a graph and the existence of k-factors
- The edge-chromatic class of regular graphs of degree 4 and their complements
- Some parameters of graph and its complement
- A generalization of a result of Häggkvist and Nicoghossian
- Subgraphs of colour-critical graphs
- A note on the computation on the k-closure of a graph
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
- Cycles and paths through specified vertices in k-connected graphs
- The subgraph homeomorphism problem for small wheels
- On constructive methods in the theory of colour-critical graphs
- 1-factorizing regular graphs of high degree - an improved bound
- Neighbourhood unions and Hamiltonian properties in graphs
- Large circuits in binary matroids of large cogirth. I
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- On n-extendable graphs
- Minimum graphs with complete k-closure
- Relative lengths of paths and cycles in 3-connected graphs
- Graphs with certain families of spanning trees
- Cycles in bipartite graphs
- Maximale Kreise in Graphen
- On k-path Hamiltonian maximal planar graphs
- Relative lengths of paths and cycles in k-connected graphs
- Stable properties of graphs
- Cycles through three vertices in 2-connected graphs
- Hamiltonian properties of graphs with large neighborhood unions
- A condition for a Hamiltonian bipartite graph to be bipancyclic
- Cycles containing many vertices of large degree
- Neighborhood unions and a generalization of Dirac's theorem
- Hamiltonian graphs involving neighborhood intersections
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- A method in graph theory
- Panconnected graphs. II
- An Ore-type condition implying a digraph to be pancyclic
- A note on 1-factors in certain regular multigraphs
- Hamiltonian cycles in regular graphs of moderate degree
- On some sequencing problems in finite groups
- Hamilton cycles in regular 2-connected graphs
- Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques
- Long cycles through specified vertices in a graph
- Bridges of longest cycles
- Proof of the Seymour conjecture for large graphs
- Large circuits in binary matroids of large cogirth. II
- On 2-factors containing 1-factors in bipartite graphs
- Design type problems motivated by database theory
- A degree condition for the existence of 1-factors in graphs or their complements
- Total chromatic number of graphs of odd order and high degree
- On the circumferences of regular 2-connected graphs
- On the complexity of recognizing tough graphs
- A generalization of Ore's Theorem involving neighborhood unions
- Extremal problems and generalized degrees
- On cycle lengths in graphs of moderate degree
- Relating path coverings to vertex labellings with a condition at distance two
- Dirac's minimum degree condition restricted to claws
- \(D_ \lambda\)-cycles in \(\lambda\)-claw-free graphs
- \(C_ 6\)-free bipartite graphs and product representation of squares
- Subgraph distances in graphs defined by edge transfers
- Cycles through subsets with large degree sums
- The complexity of recognizing tough cubic graphs
- A sufficient condition for all short cycles
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- Square Hamiltonian cycles in graphs with maximal 4-cliques
- Hamiltonicity in 2-connected graphs with claws
- Intersections of longest cycles in \(k\)-connected graphs
- The hidden algorithm of Ore's theorem on Hamiltonian cycles
- Pancyclic graphs and a conjecture of Bondy and Chvatal
- Graphs with large maximum degree containing no odd cycles of a given length
- Connectivity of \(k\)-extendable graphs with large \(k\).
- On a tiling conjecture of Komlós for 3-chromatic graphs.
- Cycles within specified distance from each vertex.
- Vertices of small degree in uniquely Hamiltonian graphs
- Weakly pancyclic graphs
This page was built for publication: Some Theorems on Abstract Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5812733)
