- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Decomposition of Graphs Into Graphs with Bounded Maximum Degrees ; volume:18 ; number:1 ; year:1985 ; pages:295-302 ; extent:8
Demonstratio mathematica ; 18, Heft 1 (1985), 295-302 (gesamt 8)
- Urheber
-
Lone, Zbigniew
Truszczyński, Mirosław
- DOI
-
10.1515/dema-1985-0121
- URN
-
urn:nbn:de:101:1-2411151543183.360107671689
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:33 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
- Lone, Zbigniew
- Truszczyński, Mirosław
Ähnliche Objekte (12)
Distinguishing numbers of infinite graphs with bounded degrees
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
The Maximum Number of Cliques in Graphs with Bounded Odd Circumference
Embedding spanning bounded degree graphs in randomly perturbed graphs
Absence of percolation in graphs based on stationary point processes with degrees bounded by two
Recognizing Map Graphs of Bounded Treewidth
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Uniform generation of temporal graphs with given degrees
Uniform generation of temporal graphs with given degrees
Graph decomposition in routing and compilers
Determinate STG Decomposition of Marked Graphs
Distinguishing numbers of infinite graphs with bounded degrees
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
The Maximum Number of Cliques in Graphs with Bounded Odd Circumference
Embedding spanning bounded degree graphs in randomly perturbed graphs
Absence of percolation in graphs based on stationary point processes with degrees bounded by two
Recognizing Map Graphs of Bounded Treewidth
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Uniform generation of temporal graphs with given degrees
Uniform generation of temporal graphs with given degrees
Graph decomposition in routing and compilers
Determinate STG Decomposition of Marked Graphs
Distinguishing numbers of infinite graphs with bounded degrees
Approximating Maximum Integral Multiflows on Bounded Genus Graphs
The Maximum Number of Cliques in Graphs with Bounded Odd Circumference
Embedding spanning bounded degree graphs in randomly perturbed graphs
Absence of percolation in graphs based on stationary point processes with degrees bounded by two
Recognizing Map Graphs of Bounded Treewidth
Deleting Vertices to Graphs of Bounded Genus
Ultrafilter Extensions of Bounded Graphs are Elementary
Uniform generation of temporal graphs with given degrees
Uniform generation of temporal graphs with given degrees
Graph decomposition in routing and compilers