Login / Signup
Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching.
Frantisek Kardos
Edita Mácajová
Jean Paul Zerafa
Published in:
J. Comb. Theory, Ser. B (2023)
Keyphrases
</>
graph matching
pairwise
maximum weight
directed graph
graph theoretic
bipartite graph
graph theory
pattern matching
matching algorithm
graph structure
maximum cardinality
image matching
connected components
high speed
spanning tree
similarity scores
face recognition