C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
On disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs.
Davit Aslanyan
Vahan V. Mkrtchyan
Samvel S. Petrosyan
Gagik N. Vardanyan
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
weighted graph
undirected graph
edge detection
graph mining
edge information
pairwise
multiple scales
graph properties
labeled graphs
maximum number
strongly connected
graph data
subgraph matching
image processing
vertex set
subgraph isomorphism
edge weights
bipartite graph
edge detector
b spline
multiscale