Results 221 to 230 of about 33,816 (262)
Some of the next articles are maybe not open access.
Oriented hamilton cycles in digraphs
Journal of Graph Theory, 1995AbstractWe show that a directed graph of order n will contain n‐cycles of every orientation, provided each vertex has indegree and outdegree at least (1/2 + n‐1/6)n and n is sufficiently large. © 1995 John Wiley & Sons, Inc.
Häggkvist, Roland, Thomason, Andrew
openaire +1 more source
Packing Directed Hamilton Cycles Online
SIAM Journal on Discrete Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anastos, Michael, Briggs, Joseph
openaire +2 more sources
Independence trees and Hamilton cycles
Journal of Graph Theory, 1998Summary: Let \(G\) be a connected graph on \(n\) vertices. A spanning tree \(T\) of \(G\) is called an independence tree, if the set of end vertices of \(T\) (vertices with degree one in \(T\)) is an independent set in \(G\). If \(G\) has an independence tree, then \(\alpha_t(G)\) denotes the maximum number of end vertices of an independence tree of ...
Broersma, Haitze J., Tuinstra, Hilde
openaire +3 more sources
1991
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no more than k times, k = [n/A 1n n], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic."
Frieze, Reed, Bruce A.
openaire +1 more source
Abstract: "The edges of the complete graph K[subscript n] are coloured so that no colour appears no more than k times, k = [n/A 1n n], for some sufficiently large A. We show that there is always a Hamiltonian cycle in which each edge is a different colour. The proof technique is probabilistic."
Frieze, Reed, Bruce A.
openaire +1 more source
Journal of Graph Theory, 2007
AbstractThe prism over a graph G is the Cartesian product G □ K2 of G with the complete graph K2. If G is hamiltonian, then G□K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian.
Kaiser, Tomáš +4 more
openaire +1 more source
AbstractThe prism over a graph G is the Cartesian product G □ K2 of G with the complete graph K2. If G is hamiltonian, then G□K2 is also hamiltonian but the converse does not hold in general. Having a hamiltonian prism is shown to be an interesting relaxation of being hamiltonian.
Kaiser, Tomáš +4 more
openaire +1 more source
Neighborhood unions and hamilton cycles
Journal of Graph Theory, 1991AbstractLet G be a graph on n vertices and N2(G) denote the minimum size of N(u) ∪ N(v) taken over all pairs of independent vertices u, v of G. We show that if G is 3‐connected and N2(G) ⩾ ½(n + 1), then G has a Hamilton cycle. We show further that if G is 2‐connected and N2(G) ⩾ ½(n + 3), then either G has a Hamilton cycle or else G belongs to one of ...
openaire +1 more source
Hamilton Cycles in Oriented Graphs
Combinatorics, Probability and Computing, 1993It is shown that an oriented graph of order n whose every indegree and outdegree is at least cn is hamiltonian if c ≥ ½ − 2−15 but need not be if c < ⅜.
openaire +1 more source
Hamilton Cycles and Paths in Fullerenes
Journal of Chemical Information and Modeling, 2007AbstractChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 200 leading journals. To access a ChemInform Abstract, please click on HTML or PDF.
openaire +2 more sources
Hamilton Cycles in Random Regular Digraphs
Combinatorics, Probability and Computing, 1994We prove that almost every r-regular digraph is Hamiltonian for all fixed r ≥ 3.
Cooper, Colin +2 more
openaire +2 more sources