Cubic graphs that cannot be covered with four perfect matchings.
Edita MácajováMartin SkovieraPublished in: J. Comb. Theory, Ser. B (2021)
Keyphrases
- maximum cardinality
- graph mining
- b spline
- bipartite graph
- graph matching
- graph clustering
- directed graph
- graph theory
- graph theoretical
- graph representation
- case study
- complex networks
- database
- graph structure
- data structure
- undirected graph
- graph partitioning
- graph theoretic
- website
- neural network
- structured objects
- real time