Vertex-, edge-, and total-colorings of Sierpiński-like graphs
From MaRDI portal
Publication:1024467
DOI10.1016/J.DISC.2008.02.026zbMATH Open1198.05056OpenAlexW1988724208MaRDI QIDQ1024467FDOQ1024467
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.026
Recommendations
- Total coloring for generalized Sierpiński graphs
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- scientific article; zbMATH DE number 4114659
- On the simultaneous edge coloring of graphs
- A generalization of edge-coloring in graphs
- scientific article; zbMATH DE number 810478
- Edge-colouring and total-colouring chordless graphs
- On total colourings of graphs
- Some results on edge-colourings of graphs
Cites Work
- The average distance on the Sierpiński gasket
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- 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?)
- Crossing numbers of Sierpiński‐like graphs
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- Coloring Sierpiński graphs and Sierpiński gasket graphs
- Total colourings of graphs
- A trace theorem for the Dirichlet form on the Sierpinski gasket
- Title not available (Why is that?)
- On the planarity of Hanoi graphs
- Codes and \(L(2,1)\)-labelings in Sierpiński graphs
- Hanoi graphs and some classical numbers
- The diameter of Hanoi graphs
- Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space
- Title not available (Why is that?)
- A result on the total colouring of powers of cycles
- Behzad-Vizing conjecture and Cartesian-product graphs
Cited In (28)
- Metric properties of Sierpiński-like graphs
- New results on variants of covering codes in Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- The Wiener index of Sierpiński-like graphs
- Total colorings-a survey
- On total chromatic number of direct product graphs
- Finding the edge ranking number through vertex partitions
- Irregular colorings of certain classes of corona product and Sierpiński graphs
- The average eccentricity of Sierpiński graphs
- The outer-connected domination number of Sierpiński-like graphs
- Global strong defensive alliances of Sierpiński-like graphs
- The hub number of Sierpiński-like graphs
- Distances in Sierpiński graphs and on the Sierpiński gasket
- Shortest paths in Sierpiński graphs
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- Packing coloring of Sierpiński-type graphs
- On the packing coloring of base-3 Sierpiński graphs and \(H\)-graphs
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
- The Sierpiński product of graphs
- On the cop number of Sierpinski-like graphs
- Sierpiński products of r-uniform hypergraphs
- Title not available (Why is that?)
- Structural properties of subdivided-line graphs
- Feedback vertex number of Sierpiński-type graphs
- Coloring Hanoi and Sierpiński graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- Coloring the square of Sierpiński graphs
This page was built for publication: Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024467)