Results 51 to 60 of about 413 (64)
Eulerian $k$-dominating reconfiguration graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor a graph $G$, the vertices of the $k$-dominating graph, denoted $\mathcal{D}_k(G)$, correspond to the dominating sets of $G$ with cardinality at most $k$. Two vertices of $\mathcal{D}_k(G)$ are adjacent if and only if the corresponding dominating sets
M. E. Messinger, A. Porter
doaj +1 more source
Toughness and hamiltonicity in $k$-trees [PDF]
, 2001 We consider toughness conditions that guarantee the existence of a hamiltonian cycle in $k$-trees, a subclass of the class of chordal graphs. By a result of Chen et al.\ 18-tough chordal graphs are hamiltonian, and by a result of Bauer et al.\ there ...
Broersma, H.J., Xiong, L., Yoshimoto, K.
core +1 more source
ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH
Forum of Mathematics, Sigma, 2017 Given a finite group $G$ , the generating graph $\unicode[STIX]{x1D6E4}(G)$
ANDREA LUCCHINI, CLAUDE MARION
doaj +1 more source
Cycle Partitions in Dense Regular Digraphs and Oriented Graphs
Forum of Mathematics, SigmaA conjecture of Jackson from 1981 states that every d-regular oriented graph on n vertices with $n\leq 4d+1$ is Hamiltonian. We prove this conjecture for sufficiently large n.
Allan Lo +2 more
doaj +1 more source
Rainbow Hamilton cycles in random regular graphs
, 2005 A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n tends ...
Janson, Svante, Wormald, Nicholas
core +2 more sources
Cayley graphs of order kp are hamiltonian for k < 48
, 2018 We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p is prime, then every connected Cayley graph on G is hamiltonian (unless kp = 2).
Morris, Dave Witte, Wilk, Kirsten
core
Eulerian character degree graphs of solvable groups
AKCE International Journal of Graphs and CombinatoricsLet G be a finite group, let Irr(G) be the set of all complex irreducible characters of G and let cd(G) be the set of all degrees of characters in [Formula: see text] Let [Formula: see text] be the set of all primes that divide some degrees in [Formula ...
G. Sivanesan +2 more
doaj +1 more source
On stability of the hamiltonian index under contractions and closures
Journal of Graph Theory, 2005 Liming Xiong, Z. Ryjáček, H. Broersma
semanticscholar +1 more source
Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem. [PDF]
J Math Biol, 2018 Prohaska SJ +7 more
europepmc +1 more source