Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem
Work
Year: 2023
Type: article
Abstract: A simple graph $G$ with edge-connectivity $\lambda(G)$ and minimum degree $\delta(G)$ is maximally edge connected if $\lambda(G)=\delta(G)$. In 1964, given a non-increasing degree sequence $\pi=(d_{1}... more
Source: Journal of Graph Theory
Author James M. Shook
Institution National Institute of Standards and Technology
Cites: 21
Cited by: 1
Related to: 10
FWCI: 0.325
Citation percentile (by year/subfield): 48.35
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green