Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) (Q2236221): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2021/3376981 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3199310616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton-connectivity of line graphs with application to their detour index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total chromatic number of generalized Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total graph of Mycielski graphs, central graphs and their covering numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic numbers of Mycielski's graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number and Mycielski construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number for iterated Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number and Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number and a generalization of the construction of Mycielski. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of the Mycielskian of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of the Mycielskian of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties, proved and conjectured, of Keller, Mycielski, and queen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cube of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on tait colorings with an application to the generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hamilton connectivity of generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank

Latest revision as of 21:12, 26 July 2024

scientific article
Language Label Description Also known as
English
Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
scientific article

    Statements

    Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) (English)
    0 references
    0 references
    0 references
    0 references
    22 October 2021
    0 references
    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.
    0 references

    Identifiers