Strong 2-degenerate graph embeddings

DOI10.1142/S1793830923500076zbMATH Open1539.05018MaRDI QIDQ6551190

Peng Ying, Xia Zhang

Publication date: 6 June 2024

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

embeddingcodegreestrong 2-degenerate graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
• Loebl-Komlós-Sós conjecture: dense case
• The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
• Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
• Expanding graphs contain all small trees
• Hamiltonian circuits in random graphs
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• On a conjecture about trees in graphs with large girth
• The Komlós conjecture for graphs of girth 7
• Tree containment and degree conditions
• Tree embeddings
• The Erdős‐Sós Conjecture for trees of diameter four

This page was built for publication: Strong 2-degenerate graph embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551190)