- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Grounded L-Graphs Are Polynomially $$\chi $$ χ -Bounded ; volume:70 ; number:4 ; day:16 ; month:11 ; year:2023 ; pages:1523-1550 ; date:12.2023
Discrete & computational geometry ; 70, Heft 4 (16.11.2023), 1523-1550, 12.2023
- Urheber
-
Davies, James
Krawczyk, Tomasz
McCarty, Rose
Walczak, Bartosz
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00454-023-00592-z
- URN
-
urn:nbn:de:101:1-2024021310512718207266
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:34 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
- Davies, James
- Krawczyk, Tomasz
- McCarty, Rose
- Walczak, Bartosz
- SpringerLink (Online service)
Ähnliche Objekte (12)
Recognizing Map Graphs of Bounded Treewidth
Separating Polynomial $$\chi $$ χ -Boundedness from $$\chi $$ χ -Boundedness
Mu Ch'i
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
..chAT chAT!! chAT! chiKO!
Distinguishing numbers of infinite graphs with bounded degrees
Definable decompositions for graphs of bounded linear cliquewidth
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
Constructing tree decompositions of graphs with bounded gonality
Recognizing Map Graphs of Bounded Treewidth
Separating Polynomial $$\chi $$ χ -Boundedness from $$\chi $$ χ -Boundedness
Mu Ch'i
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
..chAT chAT!! chAT! chiKO!
Distinguishing numbers of infinite graphs with bounded degrees
Definable decompositions for graphs of bounded linear cliquewidth
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
Constructing tree decompositions of graphs with bounded gonality
Recognizing Map Graphs of Bounded Treewidth
Separating Polynomial $$\chi $$ χ -Boundedness from $$\chi $$ χ -Boundedness
Mu Ch'i
Embedding spanning bounded degree graphs in randomly perturbed graphs
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
..chAT chAT!! chAT! chiKO!
Distinguishing numbers of infinite graphs with bounded degrees
Definable decompositions for graphs of bounded linear cliquewidth
Approximating Maximum Integral Multiflows on Bounded Genus Graphs