Chromatic properties of the Pancake graphs
From MaRDI portal
Publication:2364095
Recommendations
Cites work
- scientific article; zbMATH DE number 5139470 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- Another bound on the chromatic number of a graph
- Efficient dominating sets in Cayley graphs.
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
- On Some Structural Properties of Star and Pancake Graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- On the embedding of cycles in pancake graphs
Cited in
(2)
This page was built for publication: Chromatic properties of the Pancake graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364095)