Results 51 to 60 of about 350 (134)
, 2023 A Harris Graph is a tough, Eulerian, non-Hamiltonian graph. Several approaches to creating new Harris graphs from existing ones are explored, including creating families of Harris graphs and combining Harris graphs.
Gandini, Francesca +2 more
core
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. [PDF]
Algorithms Mol Biol, 2023 Schmidt S, Alanko JN.
europepmc +2 more sources
A study on Dicycles and Eulerian Subdigraphs [PDF]
, 2016 1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dicycles of D such that each arc of D lies in at least one dicycle in F. We investigate the problem of determining the upper bounds for the minimum number of
Alsatami, Khalid A.
core +1 more source
Note on Petrie and Hamiltonian cycles in cubic polyhedral graphs [PDF]
, 1994 summary:In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane graph is equivalent to the problem of the existence of an associated cubic plane multi-3-gonal graph with a Hamiltonian cycle which takes alternately left ...
Ivančo, J., Jendroľ, S., Tkáč, M.
core +1 more source
Homopolar circuits in polar graphs [PDF]
, 1972 A theorem is proved that is, in a sense to be made precise, the best possible generalization of the theorems of Dirac, Pósa, and Bondy that give successively weaker sufficient conditions for a graph to be Hamiltonian.
Andersen, Lars Døvling +2 more
core +1 more source
Paths and Circuits in G-Graphs of Certain Non-abelian Groups [PDF]
, 2016 In [BJRTD08], necessary and suffcient conditions were given for the existence of Eulerian and Hamiltonian paths and circuits in the G-graph of the dihedral group Dn.
Dewitt, A. +2 more
core +1 more source
EULERIAN SUBGRAPHS in 3-Edge-Connected Graps AND HAMILTONIAN LINE GRAPHS
, 2003 In this paper, we show that if G is a 3-edge-connected graph with S V ðGÞ and jSj 12, then either G has an Eulerian subgraph H such that S V ðHÞ,orG can be contracted to the Petersen graph in such a way that the preimage of each vertex of the Petersen ...
Deying Li +4 more
core
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs
, 1995 . In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube and polymino. A Spanning closed trail is an eulerian subgraph containing all vertices of a given graph. For general grid graphs we prove that the problem
Alexander Zelikovsky, Hwan-gue Cho
core
Snarks, Hypohamiltonian Graphs and Non-Supereulerian Graphs
, 2016 A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G)v∈V(G), the graph G−vG−v is Hamiltonian. A graph is supereulerian if it has a spanning Eulerian subgraph.
Chen, Zhi-Hong
core +1 more source
, 2016 Graph theory is about collections of points that are joined in pairs, such as a road map with towns connected by roads or a molecule with atoms joined by chemical bonds. ‘Graphs’ revisits the Königsberg bridges problem, the knight’s tour problem, the Gas–
Robin Wilson
core +1 more source