A method in graph theory
From MaRDI portal
Publication:1227760
DOI10.1016/0012-365X(76)90078-9zbMath0331.05138WikidataQ115188650 ScholiaQ115188650MaRDI QIDQ1227760
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Moore-penrose inverse of the incidence matrix of a tree, Partition of a bipartite graph into cycles, On existence theorems, Computation of the 0-dual closure for hamiltonian graphs, Partition of a directed bipartite graph into two directed cycles, More powerful closure operations on graphs, Hamiltonism, degree sum and neighborhood intersections, Stable properties of graphs, Dominating cycles in regular 3-connected graphs, A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity, 9-connected claw-free graphs are Hamilton-connected, A note on \(K_ 4\)-closures in hamiltonian graph theory, A closure concept based on neighborhood unions of independent triples, Subgraphs, closures and hamiltonicity, On the computational complexity of graph closures, Dirac's minimum degree condition restricted to claws, Cycles through subsets with large degree sums, Small cycles in Hamiltonian graphs, On a conjecture on directed cycles in a directed bipartite graph, A new Chvátal type condition for pancyclicity, Degree sum conditions for Hamiltonicity on \(k\)-partite graphs, A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness, Hamiltonian degree conditions for tough graphs, Two vertex-disjoint cycles in a graph
