Sierpiński products of r-uniform hypergraphs
From MaRDI portal
Publication:5045249
DOI10.26493/2590-9770.1402.D50zbMATH Open1497.05194OpenAlexW3163563822MaRDI QIDQ5045249FDOQ5045249
Authors: Mark Budden, Josh Hiller
Publication date: 4 November 2022
Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/2590-9770.1402.d50
Recommendations
Cites Work
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- On some metric properties of the Sierpiński graphs \(S(n,k)\)
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- A new graph product and its spectrum
- The chromatic number and other functions of the lexicographic product
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
- Shortest paths in Sierpiński graphs
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
- Title not available (Why is that?)
- The Sierpiński product of graphs
- Trees and $n$-Good Hypergraphs
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Sierpiński products of \(r\)-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045249)