Largest planar graphs of diameter two and fixed maximum degree
From MaRDI portal
Publication:686482
DOI10.1016/0012-365X(93)90166-QzbMATH Open0837.05074MaRDI QIDQ686482FDOQ686482
Authors: Pavol Hell, K. Seyffarth
Publication date: 23 April 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cites Work
Cited In (32)
- Quantum routing in planar graph using perfect state transfer
- Title not available (Why is that?)
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- Title not available (Why is that?)
- Bounding clique size in squares of planar graphs
- On the maximum order of graphs embedded in surfaces
- The degree-diameter problem for sparse graph classes
- Classification of regular planar graphs with diameter two
- Maximum size of a planar graph with given degree and even diameter
- Structure and pancyclicity of maximal planar graphs with diameter two
- Distance-two coloring of sparse graphs
- Coloring the square of maximal Planar graphs with diameter two
- Plane graphs with large faces and small diameter
- The degree-diameter problem for outerplanar graphs
- Existential closure in line graphs
- Large planar graphs with given diameter and maximum degree
- Dynamic coloring parameters for graphs with given genus
- Covering planar graphs with a fixed number of balls
- Largest Graphs of Diameter 2 and Maximum Degree 6
- Largest Graphs of Diameter 2 and Maximum Degree 6
- Steiner diameter of 3, 4 and 5-connected maximal planar graphs
- Title not available (Why is that?)
- Largest planar graphs and largest maximal planar graphs of diameter two
- List coloring and diagonal coloring for plane graphs of diameter two
- An introduction to the discharging method via graph coloring
- Maximum size of a planar graph with given degree and diameter
- New constructions of large scale planar networks with given diameter and maximum degree
- Combinatorial Geometry and Graph Theory
- Title not available (Why is that?)
- A unified approach to distance-two colouring of graphs on surfaces
- Constructions of large planar networks with given degree and diameter
This page was built for publication: Largest planar graphs of diameter two and fixed maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686482)