Chromatic properties of the Pancake graphs
From MaRDI portal
Publication:2364095
DOI10.7151/DMGT.1978zbMATH Open1366.05043OpenAlexW2612735421MaRDI QIDQ2364095FDOQ2364095
Authors: Elena V. Konstantinova
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- 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
- Title not available (Why is that?)
- On the embedding of cycles in pancake graphs
- Title not available (Why is that?)
- Efficient dominating sets in Cayley graphs.
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
- Title not available (Why is that?)
- On Some Structural Properties of Star and 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)