Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1435-5914
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Steffen, Eckhard
Wolf, Isaak H.
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00373-022-02506-x
- URN
-
urn:nbn:de:101:1-2022080610273091993185
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:31 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
- Steffen, Eckhard
- Wolf, Isaak H.
- SpringerLink (Online service)
Other Objects (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
Loop-tree duality from vertices and edges
Hypergraph cuts with edge-dependent vertex weights
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
Loop-tree duality from vertices and edges
Hypergraph cuts with edge-dependent vertex weights
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
Loop-tree duality from vertices and edges
Hypergraph cuts with edge-dependent vertex weights
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