- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
A Tight Bound for the Number of Edges of Matchstick Graphs ; day:18 ; month:8 ; year:2023 ; pages:1-15
Discrete & computational geometry ; (18.8.2023), 1-15
- Urheber
-
Lavollée, Jérémy
Swanepoel, Konrad
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00454-023-00530-z
- URN
-
urn:nbn:de:101:1-2023110414063231896401
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lavollée, Jérémy
- Swanepoel, Konrad
- SpringerLink (Online service)
Ähnliche Objekte (12)
Tight Bounds for Online Coloring of Basic Graph Classes
The 2-edge geodetic number and graph operations
On Selkow's bound on the independence number of graphs
New bounds on the signed total domination number of graphs
New Bounds on the Double Total Domination Number of Graphs
An Improved Upper Bound on the Queue Number of Planar Graphs
Estimate of the Number of Edges in Subgraphs of a Johnson Graph
Upper bounds on the signed total (k,k)-domatic number of graphs
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
Tight Bounds for Online Coloring of Basic Graph Classes
The 2-edge geodetic number and graph operations
On Selkow's bound on the independence number of graphs
New bounds on the signed total domination number of graphs
New Bounds on the Double Total Domination Number of Graphs
An Improved Upper Bound on the Queue Number of Planar Graphs
Estimate of the Number of Edges in Subgraphs of a Johnson Graph
Upper bounds on the signed total (k,k)-domatic number of graphs
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
Tight Bounds for Online Coloring of Basic Graph Classes
The 2-edge geodetic number and graph operations
On Selkow's bound on the independence number of graphs
New bounds on the signed total domination number of graphs
New Bounds on the Double Total Domination Number of Graphs
An Improved Upper Bound on the Queue Number of Planar Graphs
Estimate of the Number of Edges in Subgraphs of a Johnson Graph
Upper bounds on the signed total (k,k)-domatic number of graphs
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers