The Komlós conjecture for graphs of girth 7
From MaRDI portal
Publication:1972153
DOI10.1016/S0012-365X(99)00316-7zbMATH Open0946.05027OpenAlexW1995016862WikidataQ123357099 ScholiaQ123357099MaRDI QIDQ1972153FDOQ1972153
Authors: Sara Nadiv Soffer 
Publication date: 23 October 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00316-7
Recommendations
- scientific article; zbMATH DE number 4053652
- On well-covered graphs of odd girth 7 or greater
- Seven problems on hypohamiltonian and almost hypohamiltonian graphs
- Maximally non-hamiltonian graphs of girth 7
- A characterization of well-indumatchable graphs having girth greater than seven
- scientific article; zbMATH DE number 434495
- Hadwiger's conjecture for the complements of Kneser graphs
- Gallai's conjecture for graphs of girth at least four
- Graphs of odd girth 7 with large degree
- Graphs of girth at least 7 have high \(b\)-chromatic number
Cited In (9)
- Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs
- Loebl-Komlós-Sós conjecture: dense case
- The approximate Loebl-Komlós-Sós conjecture. I: The sparse decomposition
- Title not available (Why is that?)
- Connectivity preserving trees in k‐connected or k‐edge‐connected graphs
- Embedding trees in graphs with independence number two
- On a conjecture about trees in graphs with large girth
- Strong 2-degenerate graph embeddings
This page was built for publication: The Komlós conjecture for graphs of girth 7
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1972153)
