Sierpiński products of r-uniform hypergraphs

DOI10.26493/2590-9770.1402.d50zbMath1497.05194OpenAlexW3163563822MaRDI QIDQ5045249

Josh Hiller, Mark R. Budden

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

zbMATH Keywords

chromatic numberscliqueshypergraph products

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
• Shortest paths in Sierpiński graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• The chromatic number and other functions of the lexicographic product
• A new graph product and its spectrum
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Trees and $n$-Good Hypergraphs
• 1-perfect codes in Sierpiński graphs
• The Sierpiński product of graphs
• On distances in Sierpiński graphs: Almost-extreme vertices and metric dimension

This page was built for publication: Sierpiński products of r-uniform hypergraphs