Connectivity of the generalised Mycielskian of digraphs
From MaRDI portal
Publication:354463
DOI10.1007/s00373-012-1151-5zbMath1268.05118MaRDI QIDQ354463
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1151-5
Related Items
Cites Work
- Connectivity of the Mycielskian of a digraph
- 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.
- Connectivity of the Mycielskian of a graph
- Several parameters of generalized Mycielskians
- Hall ratio of the Mycielski graphs
- The fractional chromatic number of mycielski's graphs
- Sur le coloriage des graphs
- A textbook of graph theory
- A lower bound on the chromatic number of Mycielski graphs