- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2886
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The maximum Wiener index of maximal planar graphs ; volume:40 ; number:4 ; day:3 ; month:10 ; year:2020 ; pages:1121-1135 ; date:11.2020
Journal of combinatorial optimization ; 40, Heft 4 (3.10.2020), 1121-1135, 11.2020
- Creator
-
Ghosh, Debarun
Győri, Ervin
Paulos, Addisu
Salia, Nika
Zamora, Oscar
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10878-020-00655-4
- URN
-
urn:nbn:de:101:1-2020121119015102266469
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ghosh, Debarun
- Győri, Ervin
- Paulos, Addisu
- Salia, Nika
- Zamora, Oscar
- SpringerLink (Online service)
Other Objects (12)
Maximale Flüsse in fast-planaren Graphen : = Maximum flows in nearly planar graphs
Hamiltonicity of maximal planar graphs and planar triangulations
How randomized search heuristics find maximum cliques in planar graphs
Planar Graph Drawing
Maximum Planar Subgraph on Graphs not Contractive to K5 or K3,3
The maximum planar subgraph problem
Multiscale planar graph generation
Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles
Maximale Kantengewichte zusammenhängender Graphen
Maximale Kantengewichte zusammenhängender Graphen
Maximal Colourings for Graphs
Parallel algorithms on planar graphs
Maximale Flüsse in fast-planaren Graphen : = Maximum flows in nearly planar graphs
Hamiltonicity of maximal planar graphs and planar triangulations
How randomized search heuristics find maximum cliques in planar graphs
Planar Graph Drawing
Maximum Planar Subgraph on Graphs not Contractive to K5 or K3,3
The maximum planar subgraph problem
Multiscale planar graph generation
Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles
Maximale Kantengewichte zusammenhängender Graphen
Maximale Kantengewichte zusammenhängender Graphen
Maximal Colourings for Graphs
Parallel algorithms on planar graphs
Maximale Flüsse in fast-planaren Graphen : = Maximum flows in nearly planar graphs
Hamiltonicity of maximal planar graphs and planar triangulations
How randomized search heuristics find maximum cliques in planar graphs
Planar Graph Drawing
Maximum Planar Subgraph on Graphs not Contractive to K5 or K3,3
The maximum planar subgraph problem
Multiscale planar graph generation
Planar Graphs with the Maximum Number of Induced 4-Cycles or 5-Cycles
Maximale Kantengewichte zusammenhängender Graphen
Maximale Kantengewichte zusammenhängender Graphen
Maximal Colourings for Graphs