On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs

On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs

Graph Theory

Bibliographic Details
Main Authors:	Christian Löwenstein, Dieter Rautenbach, Roman Soták
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2014-02-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	distance graph circulant graph hamiltonian path hamiltonian cycle [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/1261/pdf

Similar Items

On hamiltonian chain saturated uniform hypergraphs
by: Aneta Dudek, et al.
Published: (2012-01-01)

On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance
by: Shih-Yan Chen, et al.
Published: (2016-08-01)

Hamiltonian decomposition of prisms over cubic graphs
by: Moshe Rosenfeld, et al.
Published: (2015-05-01)

Graphs with many vertex-disjoint cycles
by: Dieter Rautenbach, et al.
Published: (2012-09-01)

Traceability of locally hamiltonian and locally traceable graphs
by: Johan De Wet, et al.
Published: (2016-07-01)

Convex Partitions of Graphs induced by Paths of Order Three
by: C. C. Centeno, et al.
Published: (2010-01-01)

Paths of specified length in random k-partite graphs
by: C.R. Subramanian
Published: (2001-01-01)

A Lie connection between Hamiltonian and Lagrangian optics
by: Alex J. Dragt
Published: (1997-01-01)

Extending a perfect matching to a Hamiltonian cycle
by: Adel Alahmadi, et al.
Published: (2015-03-01)

On paths, trails and closed trails in edge-colored graphs
by: Laurent Gourvès, et al.
Published: (2012-09-01)

Ore-degree threshold for the square of a Hamiltonian cycle
by: Louis DeBiasio, et al.
Published: (2015-02-01)

On edge-intersection graphs of k-bend paths in grids
by: Therese Biedl, et al.
Published: (2010-01-01)

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
by: Mickael Montassier, et al.
Published: (2008-01-01)

Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Acyclic chromatic index of fully subdivided graphs and Halin graphs
by: Manu Basavaraju
Published: (2012-10-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Generation of Cubic graphs
by: Gunnar Brinkmann, et al.
Published: (2011-07-01)

The determining number of Kneser graphs
by: José Cáceres, et al.
Published: (2013-01-01)

On the metric dimension of Grassmann graphs
by: Robert F. Bailey, et al.
Published: (2012-01-01)

On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01)

On hereditary Helly classes of graphs
by: Marina Groshaus, et al.
Published: (2008-01-01)

On-line Ramsey numbers for paths and stars
by: J. A. Grytczuk, et al.
Published: (2008-01-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

On Compact Encoding of Pagenumber $k$ Graphs
by: Cyril Gavoille, et al.
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

On the chromatic number of some flip graphs
by: Ruy Fabila-Monroy, et al.
Published: (2009-01-01)

On 4-valent Frobenius circulant graphs
by: Sanming Zhou
Published: (2012-10-01)

Progress on the traceability conjecture for oriented graphs
by: Marietjie Frick, et al.
Published: (2008-01-01)

Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01)

Upper k-tuple domination in graphs
by: Gerard Jennhwa Chang, et al.
Published: (2012-12-01)

All totally symmetric colored graphs
by: Mariusz Grech, et al.
Published: (2013-03-01)

Cycle transversals in bounded degree graphs
by: Marina Groshaus, et al.
Published: (2011-03-01)

The Erdős-Sós conjecture for geometric graphs
by: Luis Barba, et al.
Published: (2013-02-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)