Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
From MaRDI portal
Publication:6621194
M. Schacht, Bjarne Schülke, Oliver Ebsen, Christian Reiher, Giulia S. Maesaka
Publication date: 18 October 2024
Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Proof of the Seymour conjecture for large graphs
- Triangle factors of graphs without large independent sets and of weighted graphs
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
This page was built for publication: Powers of Hamiltonian cycles in \(\mu\)-inseparable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621194)
