The degree-diameter problem for sparse graph classes
From MaRDI portal
Publication:491538
zbMath1327.05292arXiv1307.4456MaRDI QIDQ491538
Guillermo Pineda-Villavicencio, David R. Wood
Publication date: 26 August 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.4456
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Graph minors (05C83)
Related Items (3)
On the maximum order of graphs embedded in surfaces ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Constructions of large graphs on surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum order of graphs embedded in surfaces
- Maximum size of a planar graph with given degree and even diameter
- \(N\)-separators in planar graphs
- Largest planar graphs of diameter two and fixed maximum degree
- A partial k-arboretum of graphs with bounded treewidth
- Diameter and treewidth in minor-closed graph families
- Diameter and treewidth in minor-closed graph families, revisited
- The extremal function for complete minors
- Large planar graphs with given diameter and maximum degree
- Layered separators in minor-closed graph classes with applications
- Local tree-width, excluded minors, and approximation algorithms
- Arc colorings of digraphs
- Asymptotically large (\(\Delta,D\))-graphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- Line Digraph Iterations and the (d, k) Digraph Problem
- An extremal function for contractions of graphs
- Constructions of large planar networks with given degree and diameter
- Decomposition of Finite Graphs Into Forests
- Normal Recurring Decimals
- LATIN 2004: Theoretical Informatics
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
This page was built for publication: The degree-diameter problem for sparse graph classes
