scientific article; zbMATH DE number 7535256

zbMath1490.05192MaRDI QIDQ5080901

Mark R. Budden, Josh Hiller, Andrew Penland

Publication date: 31 May 2022

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/82/ajc_v82_p001.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

chromatic numbershyperedge colorings

Mathematics Subject Classification ID

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

Related Items (2)

Sierpiński products of r-uniform hypergraphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Spanning trees of 3-uniform hypergraphs
• An augmenting path algorithm for linear matroid parity
• Matroid matching and some applications
• Directed hypergraphs and applications
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
• Rainbow connection for some families of hypergraphs
• Rainbow connection in graphs
• Edge colorings of complete graphs without tricolored triangles

This page was built for publication: