Chromatic properties of the Pancake graphs
From MaRDI portal
Publication:2364095
DOI10.7151/dmgt.1978zbMath1366.05043OpenAlexW2612735421MaRDI QIDQ2364095
Publication date: 17 July 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1978
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
On Some Structural Properties of Star and Pancake Graphs ⋮ Neighbor connectivity of pancake graphs and burnt pancake graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
- On the embedding of cycles in pancake graphs
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Another bound on the chromatic number of a graph
- Efficient dominating sets in Cayley graphs.
- On Some Structural Properties of Star and Pancake Graphs
This page was built for publication: Chromatic properties of the Pancake graphs