Connectivity of the Mycielskian of a graph
From MaRDI portal
Publication:2427520
DOI10.1016/j.disc.2007.05.004zbMath1151.05030OpenAlexW1992598797MaRDI QIDQ2427520
R. Balakrishnan, S. Francis Raj
Publication date: 13 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.004
Related Items
Some network topological notions of the Mycielskian of a graph ⋮ Packing chromatic number versus chromatic and clique number ⋮ Connectivity of the generalised Mycielskian of digraphs ⋮ Super connectivity and super edge connectivity of the Mycielskian of a graph ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ The generalized 3-connectivity of the Mycielskian of a graph ⋮ The hub number, girth and Mycielski graphs ⋮ Connectivity of the Mycielskian of a digraph ⋮ Unnamed Item
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
- Circular chromatic number and Mycielski construction
- Connectivity of transitive graphs
- Sur le coloriage des graphs
- A textbook of graph theory
- Circular chromatic number and Mycielski graphs
- Eine Eigenschaft der Atome endlicher Graphen
