Connectivity of the Mycielskian of a digraph
From MaRDI portal
Publication:735134
DOI10.1016/J.AML.2009.05.007zbMATH Open1171.05352OpenAlexW2026327238MaRDI QIDQ735134FDOQ735134
Authors: Litao Guo, Xiaofeng Guo
Publication date: 14 October 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2009.05.007
Recommendations
Cites Work
- Circular chromatic numbers of Mycielski's graphs
- Circular chromatic number and a generalization of the construction of Mycielski.
- Circular chromatic number for iterated Mycielski graphs
- Super connectivity and super edge connectivity of the Mycielskian of a graph
- Connectivity of the Mycielskian of a graph
- Circular chromatic number and Mycielski construction
- Circular chromatic number and Mycielski graphs
Cited In (8)
- The generalized 3-connectivity of the Mycielskian of a graph
- D-Mycielskian graph of a graph
- Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
- Connectivity of the generalised Mycielskian of digraphs
- Super connectivity and super arc connectivity of the Mycielskian of a digraph.
- Super connectivity and super edge connectivity of the Mycielskian of a graph
- Connectivity of Imase and Itoh digraphs
- Connectivity of the Mycielskian of a graph
This page was built for publication: Connectivity of the Mycielskian of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735134)