Coloring Sierpiński graphs and Sierpiński gasket graphs
From MaRDI portal
Publication:934297
DOI10.11650/twjm/1500574171zbMath1154.05032OpenAlexW1871073562MaRDI QIDQ934297
Publication date: 29 July 2008
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500574171
Hamiltonian cyclechromatic numberchromatic index1-perfect codeSierpinski graphsSierpinski gasket graphs
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Related Items (12)
Irregularity of Sierpinski graph ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ Metric properties of Sierpiński triangle graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ Unnamed Item ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ Feedback vertex number of Sierpiński-type graphs ⋮ The outer-connected domination number of Sierpiński-like graphs
This page was built for publication: Coloring Sierpiński graphs and Sierpiński gasket graphs
