scientific article; zbMATH DE number 7535256
From MaRDI portal
Publication:5080901
zbMATH Open1490.05192MaRDI QIDQ5080901FDOQ5080901
Mark 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 of this publication is not available (Why is that?)
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Directed hypergraphs and applications
- Rainbow connection in graphs
- Matroid matching and some applications
- Edge colorings of complete graphs without tricolored triangles
- Title not available (Why is that?)
- An augmenting path algorithm for linear matroid parity
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
- Spanning trees of 3-uniform hypergraphs
- Rainbow connection for some families of hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- The minimum number of vertices in uniform hypergraphs with given domination number
- Minimum shadows in uniform hypergraphs and a generalization of the Takagi function
- Sierpiński products of r-uniform hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximally connected \(p\)-partite uniform hypergraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080901)
