The palette index of Sierpiński triangle graphs and Sierpiński graphs
From MaRDI portal
Publication:5068489
Recommendations
Cites work
- scientific article; zbMATH DE number 1984022 (Why is no real title available?)
- scientific article; zbMATH DE number 5043398 (Why is no real title available?)
- A family of multigraphs with large palette index
- A survey and classification of Sierpiński-type graphs
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Minimum number of palettes in edge colorings
- On the palette index of a graph: the case of trees
- On the palette index of complete bipartite graphs
- On topological properties of Sierpinski networks
- Some results on the palette index of graphs
- The NP-Completeness of Edge-Coloring
- The average distance on the Sierpiński gasket
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Cited in
(3)
This page was built for publication: The palette index of Sierpiński triangle graphs and Sierpiński graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5068489)