The palette index of Sierpiński triangle graphs and Sierpiński graphs
From MaRDI portal
Publication:5068489
DOI10.17223/20710410/54/5zbMATH Open1486.05088MaRDI QIDQ5068489FDOQ5068489
Authors:
Publication date: 6 April 2022
Full work available at URL: http://mathnet.ru/eng/pdm755
Recommendations
Cites Work
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- The average distance on the Sierpiński gasket
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- The NP-Completeness of Edge-Coloring
- On topological properties of Sierpinski networks
- Some results on the palette index of graphs
- A survey and classification of Sierpiński-type graphs
- On the palette index of complete bipartite graphs
- Minimum number of palettes in edge colorings
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- On the palette index of a graph: the case of trees
- A family of multigraphs with large palette index
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)