The hub number, girth and Mycielski graphs
From MaRDI portal
Publication:2015153
DOI10.1016/j.ipl.2014.04.014zbMath1371.05218OpenAlexW2068690879MaRDI QIDQ2015153
Baoyindureng Wu, Zhilan Dang, Xiao-Ping Liu
Publication date: 23 June 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.04.014
Cites Work
- Unnamed Item
- Unnamed Item
- The hub number of Sierpiński-like graphs
- The hub number of a graph
- Routing sets in the integer lattice
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Super connectivity and super edge connectivity of the Mycielskian of a graph
- Connectivity of the Mycielskian of a graph
- Bounds on the connected domination number of a graph
- Several parameters of generalized Mycielskians
- The connected hub number and the connected domination number
- Total domination in graphs
- The fractional chromatic number of mycielski's graphs
- Sur le coloriage des graphs