The hub number, girth and Mycielski graphs
From MaRDI portal
Publication:2015153
DOI10.1016/J.IPL.2014.04.014zbMATH Open1371.05218OpenAlexW2068690879MaRDI QIDQ2015153FDOQ2015153
Xiaoping Liu, Baoyindureng Wu, Zhilan Dang
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur le coloriage des graphs
- The hub number of Sierpiลski-like graphs
- Total domination in graphs
- 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
- The hub number of a graph
- Several parameters of generalized Mycielskians
- The fractional chromatic number of mycielski's graphs
- Bounds on the connected domination number of a graph
- The connected hub number and the connected domination number
- Routing sets in the integer lattice
Cited In (2)
Recommendations
- The hub number of Sierpiลski-like graphs ๐ ๐
- The hub number of a graph ๐ ๐
- The connected hub number and the connected domination number ๐ ๐
- Hubtic number in graphs ๐ ๐
- The hub number of co-comparability graphs ๐ ๐
- The Mycielskian of a graph ๐ ๐
- HUB PARAMETERS AND MYCIELSKIAN OF A GRAPH ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
This page was built for publication: The hub number, girth and Mycielski graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015153)