OpenAlex
The Balancing Number and Generalized Balancing Number of Some Graph Classes
Work
Year: 2023
Type: article
Abstract: Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges is in each color class. If there exists an inte... more
Cites: 12
Cited by: 3
Related to: 10
FWCI: 2.875
Citation percentile (by year/subfield): 86.23
Open Access status: diamond