The extremal graph problem of the icosahedron
From MaRDI portal
Publication:1394239
DOI10.1016/0095-8956(74)90051-3zbMATH Open0279.05124OpenAlexW2019461764MaRDI QIDQ1394239FDOQ1394239
Authors: Miklós Simonovits
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(74)90051-3
Cites Work
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- On the structure of linear graphs
- Title not available (Why is that?)
- An extremal graph problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- The extremal graph problem of the icosahedron
Cited In (8)
- The extremal graph problem of the icosahedron
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Extremal graphs for odd wheels
- Extremal graphs of the \(p\)th power of paths
- Extremal graphs for the odd prism
- On the Turán number of the hypercube
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Extremal graphs for edge blow-up of graphs
This page was built for publication: The extremal graph problem of the icosahedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394239)