The degree/diameter problem in maximal planar bipartite graphs (Q5965484): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2299483631 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering planar graphs with a fixed number of balls / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large planar graphs with given diameter and maximum degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4448760 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Separator Theorem for Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two trees in maximal planar bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum size of a planar graph with given degree and even diameter / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(N\)-separators in planar graphs / rank | |||
Normal rank | |||
Latest revision as of 23:26, 11 July 2024
scientific article; zbMATH DE number 6580817
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The degree/diameter problem in maximal planar bipartite graphs |
scientific article; zbMATH DE number 6580817 |
Statements
The degree/diameter problem in maximal planar bipartite graphs (English)
0 references
13 May 2016
0 references
\((\Delta, D)\) problem
0 references
maximal planar bipartite graphs
0 references
