Connectivity of the generalised Mycielskian of digraphs

DOI10.1007/s00373-012-1151-5zbMath1268.05118OpenAlexW2076667704MaRDI QIDQ354463

S. Francis Raj

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

zbMATH Keywords

strongly connected digraphsMycielskianarc-connectivitygeneralised vertex-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Indicated coloring of the Mycielskian of some families of graphs

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

This page was built for publication: Connectivity of the generalised Mycielskian of digraphs