Extremal graph theory seeks to determine the maximum or minimum values of graph invariants—such as edge count, degree sequence or subgraph density—subject to the exclusion of particular configurations ...
Graph factorization involves decomposing a network into spanning subgraphs or “factors” whose components satisfy specified structural constraints, such as paths, cycles or stars. By systematically ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results