Some Theorems on Abstract Graphs

1952/01/01 by G. A. Dirac · 105 citations
Physics and Astronomy · #Quantum Mechanics and Applications

paper · doi:10.1112/plms/s3-2.1.69

Cited by

• Robustness and hyperstability for the Erdős-Gallai theorem
• Hamiltonian cycles in 7-tough (P₄∪ P₁)-free graphs
• Breaking the Bollobás-Eldridge-Catlin Barrier for Bipartite Graphs
• Perfect matching in 4-partite 4-uniform hypergraphs
• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
• A Simple Extension of Dirac's Theorem on Hamiltonicity
• Multicolor Gallai-Ramsey numbers of C₉ and C₁₁
• Spanning trees in randomly perturbed graphs
• Exact results on generalized Erdős-Gallai problems
• Combinatorial theorems relative to a random set
• Sharp Diagonal Thresholds for Tight Hamilton Cycles in Uniformly Dense 3-Graphs
• Variants of Baranyai's Theorem with Additional Conditions
• Semi-Degree Condition for Arbitrary H-Linked Oriented Graphs
• Cycle lengths and minimum degree of graphs
• On graphs whose cycle space is spanned by their Hamilton cycles
• A Rainbow Dirac's Theorem
• Clique factors in random samplings of regular graphs
• Verifying Hadwiger's Conjecture for Examples of Graphs with α(G) = 2
• Transversal Hamilton Paths and Cycles
• The maximum number of perfect matchings of semi-regular graphs
• Toughness and Vertex Degrees
• A Common Generalization of Dirac's two Theorems
• Bootstrap percolation in Ore-type graphs
• Anti-Ramsey Number of Stars in 3-uniform hypergraphs
• Loose Hamiltonicity
• The k-proper index of complete bipartite and complete multipartite graphs
• On the Hypergraph Nash-Williams' Conjecture
• On Posa's conjecture for random graphs
• Ore's Conjecture on color-critical graphs is almost true
• Ore‐type degree conditions for a graph to be <i>H</i>‐linked
• Clique factors in Kneser graphs
• Extending two results on hamiltonian graphs involving the bipartite-hole-number
• Hamiltonicity in randomly perturbed hypergraphs
• Some sufficient conditions on Hamiltonian digraph
• Fractional matching number and spectral radius of nonnegative matrix of graphs
• A Note on Hamilton Cycles
• Mader's Conjecture and Its Variants for Cographs
• The n-queens problem
• Rainbow matchings in edge-colored graphs
• Chords of longest cycles in graphs with large circumferences
• Bipartite holes, degree sums and Hamilton cycles
• Robustness for expander graphs
• The circumference of a graph with given minimum degree and clique number
• Tree decompositions of graphs without large bipartite holes
• The maximum size of a graph with prescribed order, circumference and minimum degree
• A Polynomial time Algorithm for 3SAT
• Doubly Stochastic Subspace Clustering
• Large Y_k,b -tilings and Hamilton ℓ -cycles in k-uniform hypergraphs
• Hamilton cycles in quasirandom hypergraphs
• Counting Hamiltonian Cycles in Dirac Hypergraphs
• Hamilton Cycles, Minimum Degree, and Bipartite Holes
• Inverse Tur'an numbers
• Dirac's Condition for Spanning Halin Subgraphs
• Hamiltonian cycles in Cayley graphs of imprimitive complex reflection\n groups
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• A Note on Minimum Degree Condition for Hamiltonian (a,b)-Cycles in Hypergraphs
• Stability in the Erdos--Gallai Theorem on cycles and paths
• Transversal Hamilton Cycle in Hypergraph Systems
• Universality for transversal powers of Hamilton cycles
• Spanning trees with large maximum degrees
• A survey on Hamilton cycles in directed graphs
• Fractional Clique Decompositions of Dense Hypergraphs
• Worst-case time decremental connectivity and k-edge witness
• The Ramsey number of a long even cycle versus a star
• Ramsey numbers of long even cycles versus books
• Radio gracefulness of Moore graphs and beyond
• Robust hamiltonicity of random directed graphs
• Maxima of the Q-index: forbidden even cycles
• Graph Invariants and Large Cycles - a Catalog of Pure Links
• On the pancyclicity of 2-connected [5,3]-graphs
• The exact total degree threshold for the square of a Hamilton cycle in digraphs
• Cycle Extendability of Hamiltonian Strongly Chordal Graphs
• Long Cycles in 1-tough Graphs
• From finding a spanning subgraph H to an H-factor
• Colour-biased Hamilton cycles in dense graphs and random graphs
• Clique-factors in graphs with low K_ℓ-independence number
• The Ramsey number of mixed-parity cycles III
• K_r-Factors in Graphs with Low Independence Number
• Maxima Q-index of graphs with forbidden odd cycles
• New Perspectives on Neighborhood-Prime Labelings of Graphs
• Beyond Hamiltonicity of Prime Difference Graphs
• Longest odd cycles in non-bipartite C_2k+1-free graphs
• Upper Bounds for the Number of Hamiltonian Cycles
• Powers of paths in tournaments
• A note on a degree sum condition for long cycles in graphs
• Perturbation of dense graphs
• Long paths and cycles in subgraphs of the cube
• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• The Cycle-Complete graph Ramsey numbers
• Perfect tilings with the generalised triangle in k-graphs
• Hamilton cycles in highly connected and expanding graphs
• Generalized Turán number for linear forests
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Rainbow structures in a collection of graphs with degree conditions
• Global cycle properties in locally isometric graphs
• On extremal hypergraphs for hamiltonian cycles
• Cyclic subsets of tournaments
• Random directed graphs are robustly Hamiltonian
• Erdős meets Nash-Williams
• Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions
• Large book--cycle Ramsey numbers
• Local Connectivity, Local Degree Conditions, some Forbidden Induced\n Subgraphs, and Cycle Extendability
• New bounds for linear arboricity and related problems
• F-factors in hypergraphs via absorption
• SFCM-R: A novel algorithm for the hamiltonian sequence problem