Hamilton connected graphs
From MaRDI portal
Publication:775674
zbMath0106.37103MaRDI QIDQ775674
Publication date: 1963
Published in: Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)
Related Items
Vertex pancyclic graphs, The number of disjoint perfect matchings in semi-regular graphs, On k-leaf-connected graphs, Hamilton-connectivity of line graphs with application to their detour index, Degree sums and spanning brooms of a graph, Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications, Hamiltonian extendable graphs, On a \(k\)-tree containing specified leaves in a graph, Scattering number and extremal non-Hamiltonian graphs, Extremal problems on the Hamiltonicity of claw-free graphs, Degree Conditions for Spanning Brooms, Unnamed Item, A Fan-type condition for graphs to be \(k\)-leaf-connected, The property of Hamiltonian connectedness in Toeplitz graphs, Uniformly Connected Graphs — A Survey, Edge bounds in nonhamiltonian \(k\)-connected graphs, Subdivision extendibility, Sufficient conditions for graphs to be spanning connected, A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph, The square of a block is Hamiltonian connected, Some sufficient conditions for graphs being \(k\)-leaf-connected, Minimum degree ensuring that a hypergraph is Hamiltonian-connected, Ore-type degree conditions for disjoint path covers in simple graphs, Path connected graphs, Properties, proved and conjectured, of Keller, Mycielski, and queen graphs, Improved degree conditions for Hamiltonian properties, Degree sequence conditions for a graph to be disjoint path coverable, Maximale Kreise in Graphen, One-to-one disjoint path covers on \(k\)-ary \(n\)-cubes, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs, A sufficient condition for a graph to contain two disjoint Hamiltonian cycles, Unnamed Item, On prisms, Möbius ladders and the cycle space of dense graphs, Circuits through specified edges, The existence of \(f\)-forests and \(f\)-trees in graphs, Spectral radius and Hamiltonian properties of graphs, II, Spanning 3-ended trees in almost claw-free graphs, The spanning laceability on the faulty bipartite hypercube-like networks, Covering the vertices of a digraph by cycles of prescribed length, Spanning trees: A survey, Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs, Long paths with endpoints in given vertex-subsets of graphs, A sufficient condition for 𝑘-path Hamiltonian digraphs, Hamiltonian-connected graphs, Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius, On spanning connected graphs, On cubic 2-independent Hamiltonian connected graphs, On a spanning tree with specified leaves, Application of complex networks theory in urban traffic network researches, On a spanning \(k\)-tree in which specified vertices have degree less than \(k\), Spectral analogues of Erdős' theorem on Hamilton-connected graphs, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, On n-distant Hamiltonian line graphs, Extended Keller graph and its properties, On mutually independent Hamiltonian paths, A degree sum condition for graphs to be covered by two cycles, Stars and their \(k\)-Ramsey numbers, On path connected graphs, Panconnected graphs. II, Hamiltonian cycles in Dirac graphs, Conditional fault hamiltonian connectivity of the complete graph, An asymptotic version of a conjecture by Enomoto and Ota, On the spanning connectivity and spanning laceability of hypercube-like networks, Graph theory, On the number of disjoint perfect matchings of regular graphs with given edge connectivity, Paired many-to-many disjoint path covers of hypertori, Hamiltonicity in Partly claw-free graphs, On a spanning \(K\)-tree containing specified vertices in a graph, Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process, Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius, Spectral radius and Hamiltonicity of graphs with large minimum degree, On the spanning fan-connectivity of graphs, On n-distant Hamiltonian line graphs, On k-path Hamiltonian graphs and line-graphs, Theory of path length distributions. I, Survey on path and cycle embedding in some networks, On the extremal number of edges in Hamiltonian connected graphs, Proof of a conjecture of Haeggkvist on cycles and independent edges, Highly Irregular, Graphs uniquely Hamiltonian-connected from a vertex, Maximum non-path-connected graphs, Hamiltonian paths and hamiltonian connectivity in graphs, On \(k\)-path pancyclic graphs, Improved sufficient conditions for Hamiltonian properties, Unnamed Item, Degree sum condition for \(k\)-ordered Hamiltonian connected graphs, Wheel and star-critical Ramsey numbers for quadrilateral, Path extendable graphs, Extending matchings in graphs: A survey
