Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1435-5914
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices ; volume:38 ; number:3 ; day:30 ; month:5 ; year:2022 ; pages:1-11 ; date:6.2022
Graphs and combinatorics ; 38, Heft 3 (30.5.2022), 1-11, 6.2022
- Urheber
-
Steffen, Eckhard
Wolf, Isaak H.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00373-022-02506-x
- URN
-
urn:nbn:de:101:1-2022080610273091993185
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 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
- Steffen, Eckhard
- Wolf, Isaak H.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Edge colourings and qualitative representations of chromatic algebras
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
Deletion of a vertex in even sum domination
On Vertex-Edge-Critically n-Connected Graphs
Hypergraph cuts with edge-dependent vertex weights
Loop-tree duality from vertices and edges
Graphs with multiplicative vertex-coloring 2-edge-weightings
2-Edge-Colored Chromatic Number of Grids is at Most 9
Chromatic Scale
Chromatic fragments
Chromatic aberration
The edge-labeling and vertex-colors of K n
Edge colourings and qualitative representations of chromatic algebras
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
Deletion of a vertex in even sum domination
On Vertex-Edge-Critically n-Connected Graphs
Hypergraph cuts with edge-dependent vertex weights
Loop-tree duality from vertices and edges
Graphs with multiplicative vertex-coloring 2-edge-weightings
2-Edge-Colored Chromatic Number of Grids is at Most 9
Chromatic Scale
Chromatic fragments
Chromatic aberration
The edge-labeling and vertex-colors of K n
Edge colourings and qualitative representations of chromatic algebras
Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
Deletion of a vertex in even sum domination
On Vertex-Edge-Critically n-Connected Graphs
Hypergraph cuts with edge-dependent vertex weights
Loop-tree duality from vertices and edges
Graphs with multiplicative vertex-coloring 2-edge-weightings
2-Edge-Colored Chromatic Number of Grids is at Most 9
Chromatic Scale
Chromatic fragments
Chromatic aberration