Hamilton-connected Mycielski graphs^
From MaRDI portal
Publication:2236221
Summary: \textit{W. Jarnicki} et al. [Ars Math. Contemp. 13, No. 2, 427--460 (2017; Zbl 1380.05066)] conjectured that if \(G\) is Hamilton-connected and not \(K_2\), then its Mycielski graph \(\mu(G)\) is Hamilton-connected. In this paper, we confirm that the conjecture is true for three families of graphs: the graphs \(G\) with \(\delta(G)>| V (G)|/2\), generalized Petersen graphs \(GP(n,2)\) and \(GP(n,3)\), and the cubes \(G^3\). In addition, if \(G\) is pancyclic, then \(\mu(G)\) is pancyclic.
Recommendations
Cites work
- A method in graph theory
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- Circular chromatic number and Mycielski construction
- Circular chromatic number and Mycielski graphs
- Circular chromatic number for iterated Mycielski graphs
- Circular chromatic numbers of Mycielski's graphs
- Connectivity of the Mycielskian of a digraph
- Connectivity of the Mycielskian of a graph
- Graph theory
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- Hamilton-connectivity of line graphs with application to their detour index
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- scientific article; zbMATH DE number 3349883 (Why is no real title available?)
- On the Cube of a Graph
- On the Hamilton connectivity of generalized Petersen graphs
- On the total graph of Mycielski graphs, central graphs and their covering numbers
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
- Sur le coloriage des graphs
- Total chromatic number of generalized Mycielski graphs
Cited in
(2)
This page was built for publication: Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236221)
