Skip to main navigation
Skip to search
Skip to main content
English
日本語
Home
Profiles
Research Units
Research output
Search by expertise, name or affiliation
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings
Xiao Zhou
, Takao Nishizeki
INF - System Information Sciences
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Citation (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Edge Coloring
Subgraph
Decompose
Factorization
Polynomial time
Problem Decomposition
Graph in graph theory
Colouring
Disjoint
If and only if
Integer
Engineering & Materials Science
Coloring
Factorization
Polynomials
Decomposition