Relevant bibliographies by topics / Hamiltonian graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Hamiltonian graphs'

Author: Grafiati
Published: 7 September 2021
Last updated: 25 April 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Hamiltonian graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Hamiltonian graphs"

1

Nikoghosyan, Zh G. "Disconnected Forbidden Subgraphs, Toughness and Hamilton Cycles." ISRN Combinatorics 2013 (March 10, 2013): 1–4. http://dx.doi.org/10.1155/2013/673971.

Full text
Abstract:
In 1974, Goodman and Hedetniemi proved that every 2-connected -free graph is hamiltonian. This result gave rise many other conditions for Hamilton cycles concerning various pairs and triples of forbidden connected subgraphs under additional connectivity conditions. In this paper we investigate analogous problems when forbidden subgraphs are disconnected which affects more global structures in graphs such as tough structures instead of traditional connectivity structures. In 1997, it was proved that a single forbidden connected subgraph in 2-connected graphs can create only a trivial class of hamiltonian graphs (complete graphs) with . In this paper we prove that a single forbidden subgraph can create a non trivial class of hamiltonian graphs if is disconnected: every -free graph either is hamiltonian or belongs to a well defined class of non hamiltonian graphs; every 1-tough -free graph is hamiltonian. We conjecture that every 1-tough -free graph is hamiltonian and every 1-tough -free graph is hamiltonian.
APA, Harvard, Vancouver, ISO, and other styles
2

Adame, Luis Enrique, Luis Manuel Rivera, and Ana Laura Trujillo-Negrete. "Hamiltonicity of Token Graphs of Some Join Graphs." Symmetry 13, no. 6 (June 16, 2021): 1076. http://dx.doi.org/10.3390/sym13061076.

Full text
Abstract:
Let G be a simple graph of order n with vertex set V(G) and edge set E(G), and let k be an integer such that 1≤k≤n−1. The k-token graph G{k} of G is the graph whose vertices are the k-subsets of V(G), where two vertices A and B are adjacent in G{k} whenever their symmetric difference A▵B, defined as (A∖B)∪(B∖A), is a pair {a,b} of adjacent vertices in G. In this paper we study the Hamiltonicity of the k-token graphs of some join graphs. We provide an infinite family of graphs, containing Hamiltonian and non-Hamiltonian graphs, for which their k-token graphs are Hamiltonian. Our result provides, to our knowledge, the first family of non-Hamiltonian graphs for which it is proven the Hamiltonicity of their k-token graphs, for any 2<k<n−2.
APA, Harvard, Vancouver, ISO, and other styles
3

Paulraja, P., and Kumar Sampath. "On hamiltonian decompositions of tensor products of graphs." Applicable Analysis and Discrete Mathematics 13, no. 1 (2019): 178–202. http://dx.doi.org/10.2298/aadm170803003p.

Full text
Abstract:
Finding a hamiltonian decomposition of G is one of the challenging problems in graph theory. We do not know for what classes of graphs G and H, their tensor product G x H is hamiltonian decomposable. In this paper, we have proved that, if G is a hamiltonian decomposable circulant graph with certain properties and H is a hamiltonian decomposable multigraph, then G x H is hamiltonian decomposable. In particular, tensor products of certain sparse hamiltonian decomposable circulant graphs are hamiltonian decomposable.
APA, Harvard, Vancouver, ISO, and other styles
4

Hopkins, Brian. "Hamiltonian paths on Platonic graphs." International Journal of Mathematics and Mathematical Sciences 2004, no. 30 (2004): 1613–16. http://dx.doi.org/10.1155/s0161171204307118.

Full text
Abstract:
We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate topologically distinct Hamiltonian cycles on the icosahedron graph and to show that a regular graph embeddable on the2-holed torus is topologically uniquely Hamiltonian.
APA, Harvard, Vancouver, ISO, and other styles
5

SHERMAN, DAVID, MING TSAI, CHENG-KUAN LIN, LÁSZLÓ LIPTÁK, EDDIE CHENG, JIMMY J. M. TAN, and LIH-HSING HSU. "4-ORDERED HAMILTONICITY FOR SOME CHORDAL RING GRAPHS." Journal of Interconnection Networks 11, no. 03n04 (September 2010): 157–74. http://dx.doi.org/10.1142/s0219265910002787.

Full text
Abstract:
A graph G is k-ordered if for any sequence of k distinct vertices of G, there exists a cycle in G containing these k vertices in the specified order. It is k-ordered Hamiltonian if, in addition, the required cycle is Hamiltonian. The question of the existence of an infinite class of 3-regular 4-ordered Hamiltonian graphs was posed in 1997 by Ng and Schultz.13At the time, the only known examples were K4and K3,3. Some progress was made in 2008 by Mészáros,12when the Peterson graph was found to be 4-ordered and the Heawood graph was proved to be 4-ordered Hamiltonian; moreover, an infinite class of 3-regular 4-ordered graphs was found. In 2010 a subclass of generalized Petersen graphs was shown to be 4-ordered by Hsu et al.,10with an infinite subset of this subclass being 4-ordered Hamiltonian, thus answering the open question. In this paper we find another infinite class of 3-regular 4-ordered Hamiltonian graphs, part of a subclass of the chordal ring graphs. In addition, we classify precisely which of these graphs are 4-ordered Hamiltonian.
APA, Harvard, Vancouver, ISO, and other styles
6

Takaoka, Asahi. "Complexity of Hamiltonian Cycle Reconfiguration." Algorithms 11, no. 9 (September 17, 2018): 140. http://dx.doi.org/10.3390/a11090140.

Full text
Abstract:
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained from C i − 1 by a switch for each i with 1 ≤ i ≤ t , where a switch is the replacement of a pair of edges u v and w z on a Hamiltonian cycle with the edges u w and v z of G, given that u w and v z did not appear on the cycle. We show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete, settling an open question posed by Ito et al. (2011) and van den Heuvel (2013). More precisely, we show that the Hamiltonian cycle reconfiguration problem is PSPACE-complete for chordal bipartite graphs, strongly chordal split graphs, and bipartite graphs with maximum degree 6. Bipartite permutation graphs form a proper subclass of chordal bipartite graphs, and unit interval graphs form a proper subclass of strongly chordal graphs. On the positive side, we show that, for any two Hamiltonian cycles of a bipartite permutation graph and a unit interval graph, there is a sequence of switches transforming one cycle to the other, and such a sequence can be obtained in linear time.
APA, Harvard, Vancouver, ISO, and other styles
7

Bueno, Letícia, Luerbio Faria, Figueiredo De, and Fonseca Da. "Hamiltonian paths in odd graphs." Applicable Analysis and Discrete Mathematics 3, no. 2 (2009): 386–94. http://dx.doi.org/10.2298/aadm0902386b.

Full text
Abstract:
Lov?sz conjectured that every connected vertex-transitive graph has a Hamiltonian path. The odd graphs Ok form a well-studied family of connected, k-regular, vertex-transitive graphs. It was previously known that Ok has Hamiltonian paths for k ? 14. A direct computation of Hamiltonian paths in Ok is not feasible for large values of k, because Ok has (2k - 1, k - 1) vertices and k/2 (2k - 1, k - 1) edges. We show that Ok has Hamiltonian paths for 15 ? k ? 18. Instead of directly running any heuristics, we use existing results on the middle levels problem, therefore further relating these two fundamental problems, namely finding a Hamiltonian path in the odd graph and finding a Hamiltonian cycle in the corresponding middle levels graph. We show that further improved results for the middle levels problem can be used to find Hamiltonian paths in Ok for larger values of k.
APA, Harvard, Vancouver, ISO, and other styles
8

Keshavarz-Kohjerdi, Fatemeh, and Ruo-Wei Hung. "Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time." Algorithms 15, no. 2 (February 13, 2022): 61. http://dx.doi.org/10.3390/a15020061.

Full text
Abstract:
A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete. However, they are still open for solid supergrid graphs. In this paper, first we will verify the Hamiltonian cycle property of C-shaped supergrid graphs, which are a special case of solid supergrid graphs. Next, we show that C-shaped supergrid graphs are Hamiltonian connected except in a few conditions. For these excluding conditions of Hamiltonian connectivity, we compute their longest paths. Then, we design a linear-time algorithm to solve the longest path problem in these graphs. The Hamiltonian connectivity of C-shaped supergrid graphs can be applied to compute the optimal stitching trace of computer embroidery machines, and construct the minimum printing trace of 3D printers with a C-like component being printed.
APA, Harvard, Vancouver, ISO, and other styles
9

Shabbir, Ayesha, Muhammad Faisal Nadeem, and Tudor Zamfirescu. "The Property of Hamiltonian Connectedness in Toeplitz Graphs." Complexity 2020 (March 12, 2020): 1–6. http://dx.doi.org/10.1155/2020/5608720.

Full text
Abstract:
A spanning path in a graph G is called a Hamiltonian path. To determine which graphs possess such paths is an NP-complete problem. A graph G is called Hamiltonian-connected if any two vertices of G are connected by a Hamiltonian path. We consider here the family of Toeplitz graphs. About them, it is known only for n=3 that Tnp,q is Hamiltonian-connected, while some particular cases of Tnp,q,r for p=1 and q=2,3,4 have also been investigated regarding Hamiltonian connectedness. Here, we prove that the nonbipartite Toeplitz graph Tn1,q,r is Hamiltonian-connected for all 1<q<r<n and n≥5r−2.
APA, Harvard, Vancouver, ISO, and other styles
10

Lynch, Mark A. M. "Creating recreational Hamiltonian cycle problems." Mathematical Gazette 88, no. 512 (July 2004): 215–18. http://dx.doi.org/10.1017/s0025557200174935.

Full text
Abstract:
In this paper graphs that contain unique Hamiltonian cycles are introduced. The graphs are of arbitrary size and dense in the sense that their average vertex degree is greater than half the number of vertices that make up the graph. The graphs can be used to generate challenging puzzles. The problem is particularly challenging when the graph is large and the ‘method’ of solution is unknown to the solver.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Hamiltonian graphs"

1

Iturriaga-Velazquez, Claudia C. "Intersection graphs, fraternally orientable graphs and hamiltonian cycles." Thesis, University of Ottawa (Canada), 1994. http://hdl.handle.net/10393/6808.

Full text
Abstract:
Consider a graph G(V, E), where V and E denote the vertex and edge sets of G(V, E), respectively. An orientation $\vec G$ of G(V, E) is the result of giving an orientation to the edges of G. A directed graph is fraternally oriented if for every three vertices u, v, w, the existence of the edges $u\to w$ and $v\to w$ implies that $u\to v$ or $v\to u$. A graph G is fraternally orientable if there exists an orientation $\vec G$ that is fraternally oriented. In this thesis we study some properties of fraternally orientable graphs, and we describe an algorithm to find a hamiltonian cycle in strongly connected fraternally oriented graphs $\vec G$.
APA, Harvard, Vancouver, ISO, and other styles
2

Streib, Noah Sametz. "Planar and hamiltonian cover graphs." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/43744.

Full text
Abstract:
This dissertation has two principal components: the dimension of posets with planar cover graphs, and the cartesian product of posets whose cover graphs have hamiltonian cycles that parse into symmetric chains. Posets of height two can have arbitrarily large dimension. In 1981, Kelly provided an infinite sequence of planar posets that shows that the dimension of planar posets can also be arbitrarily large. However, the height of the posets in this sequence increases with the dimension. In 2009, Felsner, Li, and Trotter conjectured that for each integer h at least 2, there exists a least positive integer c(h) so that if P is a poset with a planar cover graph (the class of posets with planar cover graphs includes the class of planar posets) and the height of P is h, then the dimension of P is at most c(h). In the first principal component of this dissertation we prove this conjecture. We also give the best known lower bound for c(h), noting that this lower bound is far from the upper bound. In the second principal component, we consider posets with the Hamiltonian Cycle--Symmetric Chain Partition (HC-SCP) property. A poset of width w has this property if its cover graph has a hamiltonian cycle which parses into w symmetric chains. This definition is motivated by a proof of Sperner's theorem that uses symmetric chains, and was intended as a possible method of attack on the Middle Two Levels Conjecture. We show that the subset lattices have the HC-SCP property by showing that the class of posets with the strong HC-SCP property, a slight strengthening of the HC-SCP property, is closed under cartesian product with a two-element chain. Furthermore, we show that the cartesian product of any two posets from this strong class has the (weak) HC-SCP property.
APA, Harvard, Vancouver, ISO, and other styles
3

Ghenciu, Petre Ion. "Hamiltonian cycles in subset and subspace graphs." Thesis, University of North Texas, 2004. https://digital.library.unt.edu/ark:/67531/metadc4662/.

Full text
Abstract:
In this dissertation we study the Hamiltonicity and the uniform-Hamiltonicity of subset graphs, subspace graphs, and their associated bipartite graphs. In 1995 paper "The Subset-Subspace Analogy," Kung states the subspace version of a conjecture. The study of this problem led to a more general class of graphs. Inspired by Clark and Ismail's work in the 1996 paper "Binomial and Q-Binomial Coefficient Inequalities Related to the Hamiltonicity of the Kneser Graphs and their Q-Analogues," we defined subset graphs, subspace graphs, and their associated bipartite graphs. The main emphasis of this dissertation is to describe those graphs and study their Hamiltonicity. The results on subset graphs are presented in Chapter 3, on subset bipartite graphs in Chapter 4, and on subspace graphs and subspace bipartite graphs in Chapter 5. We conclude the dissertation by suggesting some generalizations of our results concerning the panciclicity of the graphs.
APA, Harvard, Vancouver, ISO, and other styles
4

High, David. "On 4-Regular Planar Hamiltonian Graphs." TopSCHOLAR®, 2006. http://digitalcommons.wku.edu/theses/277.

Full text
Abstract:
In order to research knots with large crossing numbers, one would like to be able to select a random knot from the set of all knots with n crossings with as close to uniform probability as possible. The underlying graph of a knot diagram can be viewed as a 4-regular planar graph. The existence of a Hamiltonian cycle in such a graph is necessary in order to use the graph to compute an upper bound on rope length for a given knot. The algorithm to generate such graphs is discussed and an exact count of the number of graphs is obtained. In order to allow for the existence of such a count, a somewhat technical definition of graph equivalence is used. The main result of the thesis is the asymptotic results of how fast the number of graphs with n vertices (crossings) grows with n.
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Mingchu. "Hamiltonian properties of claw-free graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0001/NQ35223.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Alabdullatif, Mosaad. "Extremal graphs with Hamiltonian related properties." Thesis, Keele University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Weihua. "Supereulerian graphs, Hamiltonicity of graphes and several extremal problems in graphs." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00877793.

Full text
Abstract:
In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereulerian.In Section 1 of Chapter 2, we characterize the graphs with minimum degree at least 2 and matching number at most 3. By using the characterization, we strengthen the result in [93] and we also address a conjecture in the paper.In Section 2 of Chapter 2, we prove that if $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$, then $G$ is collapsible except for several special graphs, where $p(n)=0$ for $n$ even and $p(n)=1$ for $n$ odd. As a corollary, a characterization for graphs satisfying $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$ to be supereulerian is obtained. This result extends the result in [21].In Section 3 of Chapter 2, we focus on a conjecture posed by Chen and Lai [Conjecture~8.6 of [33]] that every 3-edge connected and essentially 6-edge connected graph is collapsible. We find a kind of sufficient conditions for a 3-edge connected graph to be collapsible.In Chapter 3, we mainly consider the hamiltonicity of 3-connected line graphs.In the first section of Chapter 3, we give several conditions for a line graph to be hamiltonian, especially we show that every 3-connected, essentially 11-connected line graph is hamilton- connected which strengthens the result in [91].In the second section of Chapter 3, we show that every 3-connected, essentially 10-connected line graph is hamiltonian-connected.In the third section of Chapter 3, we show that 3-connected, essentially 4-connected line graph of a graph with at most 9 vertices of degree 3 is hamiltonian. Moreover, if $G$ has 10 vertices of degree 3 and its line graph is not hamiltonian, then $G$ can be contractible to the Petersen graph.In Chapter 4, we consider edge fault-tolerant hamiltonicity of Cayley graphs generated by transposition trees. We first show that for any $F\subseteq E(Cay(B:S_{n}))$, if $|F|\leq n-3$ and $n\geq4$, then there exists a hamiltonian path in $Cay(B:S_{n})-F$ between every pair of vertices which are in different partite sets. Furthermore, we strengthen the above result in the second section by showing that $Cay(S_n,B)-F$ is bipancyclic if $Cay(S_n,B)$ is not a star graph, $n\geq4$ and $|F|\leq n-3$.In Chapter 5, we consider several extremal problems on the size of graphs.In Section 1 of Chapter 5, we bounds the size of the subgraph induced by $m$ vertices of hypercubes. We show that a subgraph induced by $m$ (denote $m$ by $\sum\limits_{i=0}^ {s}2^{t_i}$, $t_0=[\log_2m]$ and $t_i= [\log_2({m-\sum\limits_{r=0}^{i-1}2 ^{t_r}})]$ for $i\geq1$) vertices of an $n$-cube (hypercube) has at most $\sum\limits_{i=0}^{s}t_i2^{t_i-1} +\sum\limits_{i=0}^{s} i\cdot2^{t_i}$ edges. As its applications, we determine the $m$-extra edge-connectivity of hypercubes for $m\leq2^{[\frac{n}2]}$ and $g$-extra edge-connectivity of the folded hypercube for $g\leq n$.In Section 2 of Chapter 5, we partially study the minimum size of graphs with a given minimum degree and a given edge degree. As an application, we characterize some kinds of minimumrestricted edge connected graphs.In Section 3 of Chapter 5, we consider the minimum size of graphs satisfying Ore-condition.
APA, Harvard, Vancouver, ISO, and other styles
8

Vandegriend, Basil. "Finding Hamiltonian cycles, algorithms, graphs and performance." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq28995.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Madden, Yale. "Loop Edge Estimation in 4-Regular Hamiltonian Graphs." TopSCHOLAR®, 2007. http://digitalcommons.wku.edu/theses/406.

Full text
Abstract:
In knot theory, a knot is defined as a closed, non-self-intersecting curve embedded in three-dimensional space that cannot be untangled to produce a simple planar loop. A mathematical knot is essentially a conventional knot tied with rope where the ends of the rope have been glued together. One way to sample large knots is based on choosing a 4-regular Hamiltonian planar graph. A method for generating rooted 4-regular Hamiltonian planar graphs with n vertices is discussed in this thesis. In the generation process of these graphs, some vertices are introduced that can be easily eliminated from the resulting knot diagram. The main result of this thesis is the estimation of the expected number of loop edges in a 4-regular Hamiltonian planar graphs of n vertices; in particular, it is shown that the expected number of loop edges L(n) in such a graph has asymptotic order n/6.
APA, Harvard, Vancouver, ISO, and other styles
10

Ascigil, Mehmet. "An Algorithm to Generate 4-Regular Planar Hamiltonian Graphs." TopSCHOLAR®, 2006. http://digitalcommons.wku.edu/theses/440.

Full text
Abstract:
In this paper, the problem of randomly generating 4-regular planar Hamiltonian graphs is discussed and a solution is described. An algorithm which efficiently generates the graphs in linear time and in a near-uniform manner is given. In addition, a formula is provided that determines the total number of such graphs. The generation of graphs starts with forming the Hamiltonian cycle of the final graph. Each vertex is randomly assigned to be connected with zero. one. Or two edges in the area bounded by the Hamiltonian cycle. A positive prefix vector is used to determine all the edges in the area bounded by the Hamiltonian cycle. Another positive prefix vector is used for determining the edges in the area not bounded by the Hamiltonian cycle, forming the final graph.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Hamiltonian graphs"

1

Reay, John R. Hamiltonian cycles in t-graphs. New York: Springer-Verlag, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Mingchu. Hamiltonian properties of claw-free graphs. Toronto: [s.n.], 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dyer, Martin. Approximately counting Hamilton cycles in dense graphs. Edinburgh: LFCS, Dept. of Computer Science, University of Edinburgh, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schaar, Günter. Hamiltonian properties of products of graphs and digraphs. Leipzig: Teubner, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Filar, Jerzy A. Controlled markov chains, graphs and hamiltonicity. Hanover, Mass: Now Publishers, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Freĭdlin, M. I. Random perturbations of Hamiltonian systems. Providence, R.I: American Mathematical Society, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kyaw, Shwe. A Dirac-type criterion for hamiltonicity. Berlin: Verlag Köster, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ning, Xuanxi. The blocking flow theory and its application to Hamiltonian graph problems. Aachen: Shaker Verlag, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Reggini, Horacio C. Regular polyhedra: Random generation, Hamiltonian paths, and single chain nets. Buenos Aires: Academia Nacional de Ciencias Exactas, Físicas y Naturales, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hertel, Alexander. Hamiltonian cycles in sparse graphs. 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Hamiltonian graphs"

1

Babel, Luitpold, and Gerhard J. Woeginger. "Pseudo-hamiltonian graphs." In Graph-Theoretic Concepts in Computer Science, 38–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0024486.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Golumbic, Martin Charles, and André Sainte-Laguë. "VII Hamiltonian graphs." In The Zeroth Book of Graph Theory, 51–60. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61420-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ray, Saha. "Euler Graphs and Hamiltonian Graphs." In Graph Theory with Algorithms and its Applications, 25–34. India: Springer India, 2012. http://dx.doi.org/10.1007/978-81-322-0750-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aldous, Joan M., and Robin J. Wilson. "Eulerian and Hamiltonian Graphs." In Graphs and Applications, 61–83. London: Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0467-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Balakrishnan, R., and K. Ranganathan. "Eulerian and Hamiltonian Graphs." In A Textbook of Graph Theory, 117–42. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-4529-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Balakrishnan, R., and K. Ranganathan. "Eulerian and Hamiltonian Graphs." In A Textbook of Graph Theory, 102–27. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4419-8505-7_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Deng-Xin, Hong-Jian Lai, Ye-Hong Shao, and Mingquan Zhan. "Hamiltonian Connected Line Graphs." In Computational Science – ICCS 2007, 377–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72588-6_61.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Borkar, Vivek S., Vladimir Ejov, Jerzy A. Filar, and Giang T. Nguyen. "Illustrative Graphs." In Hamiltonian Cycle Problem and Markov Chains, 3–8. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-3232-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Albini, Giovanni, and Marco Paolo Bernardi. "Hamiltonian Graphs as Harmonic Tools." In Mathematics and Computation in Music, 215–26. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71827-9_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nadeem, Muhammad Faisal, Ayesha Shabbir, and Tudor Zamfirescu. "Hamiltonian Connectedness of Toeplitz Graphs." In Springer Proceedings in Mathematics & Statistics, 135–49. Basel: Springer Basel, 2014. http://dx.doi.org/10.1007/978-3-0348-0859-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Hamiltonian graphs"

1

Chen, Y.-Chuang, Yong-Zen Huang, Lih-Hsing Hsu, Jimmy J. M. Tan, Theodore E. Simos, and George Psihoyios. "Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs." In INTERNATIONAL ELECTRONIC CONFERENCE ON COMPUTER SCIENCE. AIP, 2008. http://dx.doi.org/10.1063/1.3037089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Harel, David. "Hamiltonian paths in infinite graphs." In the twenty-third annual ACM symposium. New York, New York, USA: ACM Press, 1991. http://dx.doi.org/10.1145/103418.103445.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mütze, Torsten, Jerri Nummenpalo, and Bartosz Walczak. "Sparse Kneser graphs are Hamiltonian." In STOC '18: Symposium on Theory of Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3188745.3188834.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aziz, Noor A’lawiah Abd, Nader Jafari Rad, Hailiza Kamarulhaili, and Roslan Hasni. "Some properties of k-step Hamiltonian graphs." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation. AIP Publishing, 2019. http://dx.doi.org/10.1063/1.5136366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Femila, L. T. Cherin Monish, and S. Asha. "Hamiltonian fuzzy anti-magic labeling of graphs." In INTERNATIONAL CONFERENCE ON ADVANCES IN MATERIALS, COMPUTING AND COMMUNICATION TECHNOLOGIES: (ICAMCCT 2021). AIP Publishing, 2022. http://dx.doi.org/10.1063/5.0072170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hung, Ruo-Wei, Jun-Lin Li, and Chih-Han Lin. "The Hamiltonian connectivity of some alphabet supergrid graphs." In 2017 IEEE 8th International Conference on Awareness Science and Technology (iCAST). IEEE, 2017. http://dx.doi.org/10.1109/icawst.2017.8256461.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hung, Ruo-Wei, Jun-Lin Li, Hao-Yu Chih, and Chien-Hui Hou. "The Hamiltonian Property of Linear-Convex Supergrid Graphs." In 2015 Third International Symposium on Computing and Networking (CANDAR). IEEE, 2015. http://dx.doi.org/10.1109/candar.2015.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Araki, T. "Optimal adaptive fault diagnosis of cubic Hamiltonian graphs." In 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. IEEE, 2004. http://dx.doi.org/10.1109/ispan.2004.1300475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kawarabayashi, Ken-ichi, and Kenta Ozeki. "4-connected projective-planar graphs are hamiltonian-connected." In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Feder, Tomas, Rajeev Motwani, and Carlos Subi. "Finding long paths and cycles in sparse Hamiltonian graphs." In the thirty-second annual ACM symposium. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/335305.335368.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Hamiltonian graphs"

1

Markus, Lisa R. Hamiltonian Results in K(l,r)-Free Graphs. Fort Belvoir, VA: Defense Technical Information Center, June 1993. http://dx.doi.org/10.21236/ada266352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Hamiltonian graphs' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography