scientific article; zbMATH DE number 3186565
From MaRDI portal
Publication:5722819
zbMath0114.40003MaRDI QIDQ5722819
Publication date: 1962
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Dense on-line arbitrarily partitionable graphs, Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs, On Hamiltonian bipartite graphs, Flots et tensions dans un graphe, Corrigendum. Three-color Ramsey numbers for paths, On a degree sequence analogue of Pósa's conjecture, Stability in the Erdős-Gallai theorems on cycles and paths, A note on the computation on the k-closure of a graph, Scattering number and extremal non-Hamiltonian graphs, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, Degree conditions for Hamiltonicity: counting the number of missing edges, On Hamiltonian Circuits in Finite Graphs, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, A stability version for a theorem of Erdős on nonhamiltonian graphs, Transversals and bipancyclicity in bipartite graph families, Dense arbitrarily vertex decomposable graphs, Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs, Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Pancyclic graphs and a conjecture of Bondy and Chvatal, Unnamed Item, On sufficient conditions for spanning structures in dense graphs, The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number, Minimum degree ensuring that a hypergraph is Hamiltonian-connected, Rainbow structures in a collection of graphs with degree conditions, A survey on Hamilton cycles in directed graphs, Minimum graphs with complete k-closure, Families with restricted matching number and multiply covered shadows, On Degree Sequences Forcing The Square of a Hamilton Cycle, Degree sequence conditions for a graph to be disjoint path coverable, Unnamed Item, Some localization theorems on Hamiltonian circuits, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, The generating graph of some monolithic groups., Best monotone degree conditions for graph properties: a survey, Best monotone degree conditions for binding number and cycle structure, The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths, On 2-factors with \(k\) components, An Ore-type condition for arbitrarily vertex decomposable graphs, Chorded pancyclicity in \(k\)-partite graphs, Pósa-condition and nowhere-zero 3-flows, On maximal circuits in directed graphs, The binding number of a graph and its Anderson number, Hamiltonian degree sequences in digraphs, Sufficient conditions for a graph to be Hamiltonian, Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen, On path connected graphs, A method in graph theory, Tough graphs and Hamiltonian circuits. (Reprint), On the generating graphs of symmetric groups, Graph theory, On Hamiltonian cycles in hypergraphs with dense link graphs, On Hamilton's ideals, On Hamilton circuits and Hamilton paths, Spanning Trees with Few Branch Vertices, On a theorem of Chartrand, Kapoor and Kronk, Weakly pancyclic graphs, Finding long cycles in balanced tripartite graphs: a first step, Note on Hamilton circuits and Hamilton paths, Tough graphs and Hamiltonian circuits., Minimal colorings for properly colored subgraphs, Trees through specified vertices, Dirac's type sufficient conditions for hamiltonicity and pancyclicity, Berge cycles in non-uniform hypergraphs, Degree sequences forcing Hamilton cycles in directed graphs, The structure of graphs with given lengths of cycles, Two theorems on Hamiltonian graphs, New sufficient conditions for cycles in graphs, A generalization of a theorem of Nash-Williams, Solution of two problems of P. Erdős concerning Hamiltonian cycles, A degree sequence Hajnal-Szemerédi theorem
