Relevant bibliographies by topics / Rainbow Hamilton cycle

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters

Academic literature on the topic 'Rainbow Hamilton cycle'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

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 'Rainbow Hamilton cycle.'

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 "Rainbow Hamilton cycle"

1

Harvey, Nicholas, and Christopher Liaw. "Rainbow Hamilton cycles and lopsidependency." Discrete Mathematics 340, no. 6 (2017): 1261–70. http://dx.doi.org/10.1016/j.disc.2017.01.026.

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

Frieze, Alan, and Po-Shen Loh. "Rainbow hamilton cycles in random graphs." Random Structures & Algorithms 44, no. 3 (2013): 328–54. http://dx.doi.org/10.1002/rsa.20475.

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

Janson, Svante, and Nicholas Wormald. "Rainbow Hamilton cycles in random regular graphs." Random Structures and Algorithms 30, no. 1-2 (2006): 35–49. http://dx.doi.org/10.1002/rsa.20146.

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

Bal, Deepak, and Alan Frieze. "Rainbow matchings and Hamilton cycles in random graphs." Random Structures & Algorithms 48, no. 3 (2015): 503–23. http://dx.doi.org/10.1002/rsa.20594.

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

Aigner-Horev, Elad, and Dan Hefetz. "Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs." SIAM Journal on Discrete Mathematics 35, no. 3 (2021): 1569–77. http://dx.doi.org/10.1137/20m1332992.

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

Dudek, Andrzej, and Michael Ferrara. "Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs." Graphs and Combinatorics 31, no. 3 (2013): 577–83. http://dx.doi.org/10.1007/s00373-013-1391-z.

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

Bal, Deepak, Patrick Bennett, Xavier Pérez-Giménez, and Paweł Prałat. "Rainbow perfect matchings and Hamilton cycles in the random geometric graph." Random Structures & Algorithms 51, no. 4 (2017): 587–606. http://dx.doi.org/10.1002/rsa.20717.

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

Ding, Jili, Hong Bian, and Haizheng Yu. "Anti-Ramsey Numbers in Complete k-Partite Graphs." Mathematical Problems in Engineering 2020 (September 7, 2020): 1–5. http://dx.doi.org/10.1155/2020/5136104.

Full text
Abstract:
The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H. In this paper, we discuss the anti-Ramsey numbers ARKp1,p2,…,pk,Tn, ARKp1,p2,…,pk,ℳ, and ARKp1,p2,…,pk,C of Kp1,p2,…,pk, where Tn,ℳ, and C denote the family of all spanning trees, the family of all perfect matchings, and the family of all Hamilton cycles in Kp1,p2,…,pk, respectively.
APA, Harvard, Vancouver, ISO, and other styles
9

Dudek, Andrzej, Sean English, and Alan Frieze. "On Rainbow Hamilton Cycles in Random Hypergraphs." Electronic Journal of Combinatorics 25, no. 2 (2018). http://dx.doi.org/10.37236/7274.

Full text
Abstract:
Let $H_{n,p,r}^{(k)}$ denote a randomly colored random hypergraph, constructed on the vertex set $[n]$ by taking each $k$-tuple independently with probability $p$, and then independently coloring it with a random color from the set $[r]$. Let $H$ be a $k$-uniform hypergraph of order $n$. An $\ell$-Hamilton cycle is a spanning subhypergraph $C$ of $H$ with $n/(k-\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\ell$ vertices.In this note we study the existenc
APA, Harvard, Vancouver, ISO, and other styles
10

Dudek, Andrzej, Alan Frieze, and Andrzej Ruciński. "Rainbow Hamilton Cycles in Uniform Hypergraphs." Electronic Journal of Combinatorics 19, no. 1 (2012). http://dx.doi.org/10.37236/2055.

Full text
Abstract:
Let $K_n^{(k)}$ be the complete $k$-uniform hypergraph, $k\ge3$, and let $\ell$ be an integer such that $1\le \ell\le k-1$ and $k-\ell$ divides $n$. An $\ell$-overlapping Hamilton cycle in $K_n^{(k)}$ is a spanning subhypergraph $C$ of $K_n^{(k)}$ with $n/(k-\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\ell$ vertices.We show that, for some constant $c=c(k,\ell)$ and sufficiently large $n$, for every coloring (partition) of the edges of $K_n^{(k)}$ which
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Rainbow Hamilton cycle"

1

Wang, Bin. "Rainbow structures in properly edge-colored graphs and hypergraph systems." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPASG016.

Full text
Abstract:
La combinatoire extrémale est l'une des branches les plus vigoureuses des mathématiques combinatoires au cours des dernières décennies, et elle a été largement utilisée en informatique, en conception de réseaux et en conception de codage. Elle se concentre sur la détermination de la taille maximale ou minimale possible de certaines structures combinatoires, sous certaines conditions ou contraintes. Les ensembles hôtes peuvent être des graphes, des digraphes, des graphes aléatoires, des hypergraphes, des entiers, des nombres premiers, des ensembles, des graphes avec arêtes colorées, etc. Les st
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Rainbow Hamilton cycle"

1

Ferber, Asaf, and Michael Krivelevich. "Rainbow Hamilton cycles in random graphs and hypergraphs." In Recent Trends in Combinatorics. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-24298-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Rainbow Hamilton cycle' for particular source types:
Journal articles
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