Sierpiński products of r-uniform hypergraphs
From MaRDI portal
Publication:5045249
Recommendations
Cites work
- 1-perfect codes in Sierpiński graphs
- A new graph product and its spectrum
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Lexicographic products of \(r\)-uniform hypergraphs and some applications to hypergraph Ramsey theory
- Minimally connected \(r\)-uniform hypergraphs
- On distances in Sierpiński graphs: almost-extreme vertices and metric dimension
- On some metric properties of the Sierpiński graphs \(S(n,k)\)
- Shortest paths in Sierpiński graphs
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- The Sierpiński product of graphs
- The chromatic number and other functions of the lexicographic product
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
- Trees and \(n\)-good hypergraphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
Cited in
(3)
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)