Connectivity of the generalised Mycielskian of digraphs
From MaRDI portal
(Redirected from Publication:354463)
Recommendations
- Connectivity of the Mycielskian of a digraph
- Connectivity of the Mycielskian of a graph
- The generalized 3-connectivity of the Mycielskian of a graph
- Publication:4865704
- scientific article; zbMATH DE number 56829
- Connectivity of some algebraically defined digraphs
- scientific article; zbMATH DE number 1893584
- scientific article; zbMATH DE number 857069
- Generalized Connectivity of Graphs
- On the connectivity of Cayley digraphs
Cites work
- A lower bound on the chromatic number of Mycielski graphs
- A textbook of graph theory
- Circular chromatic number and a generalization of the construction of Mycielski.
- Circular chromatic numbers of Mycielski's graphs
- Connectivity of the Mycielskian of a digraph
- Connectivity of the Mycielskian of a graph
- Hall ratio of the Mycielski graphs
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
- Several parameters of generalized Mycielskians
- Sur le coloriage des graphs
- The fractional chromatic number of mycielski's graphs
Cited in
(9)- Connectivity of the Mycielskian of a digraph
- Indicated coloring of the Mycielskian of some families of graphs
- Connectivity of Imase and Itoh digraphs
- Super connectivity and super arc connectivity of the Mycielskian of a digraph.
- The generalized 3-connectivity of the Mycielskian of a graph
- Several parameters of the complement of generalized Mycielskian graph
- Connectivity of the Mycielskian of a graph
- Several parameters of generalized Mycielskians
- Generalised Mycielski graphs and the Borsuk-Ulam theorem
This page was built for publication: Connectivity of the generalised Mycielskian of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354463)
