Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
From MaRDI portal
Publication:2236221
DOI10.1155/2021/3376981zbMath1486.05173OpenAlexW3199310616MaRDI QIDQ2236221
Xinhui An, Baonyindureng Wu, Yuanyuan Shen
Publication date: 22 October 2021
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/3376981
Cites Work
- Unnamed Item
- Unnamed Item
- Total chromatic number of generalized Mycielski graphs
- Connectivity of the Mycielskian of a digraph
- On the Hamilton connectivity of generalized Petersen graphs
- A method in graph theory
- Circular chromatic numbers of Mycielski's graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- Circular chromatic number for iterated Mycielski graphs
- Hamilton-connectivity of line graphs with application to their detour index
- Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
- Connectivity of the Mycielskian of a graph
- On the total graph of Mycielski graphs, central graphs and their covering numbers
- Circular chromatic number and Mycielski construction
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs
- On the Cube of a Graph
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Sur le coloriage des graphs
- Circular chromatic number and Mycielski graphs
