Multi-switch: A tool for finding potential edge-disjoint 1-factors
Let n be even, let π = (d1, ... , dn) be a graphic degree sequence, and let π - k = (d1-k, ... , dn-k) also be graphic. Kundu proved that π has a realization G containing a k-factor, or k-regular graph. Another way to state the conclusion of Kundu's theorem is that π potentially contains a k...
Saved in:
Main Author: | Seacrest, Tyler; Departments of Mathematics, The University of Montana Western, USA (Author) |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
About the second neighborhood problem in tournaments missing disjoint stars
by: Ghazal, Salman; Department of Mathematics Faculty of Sciences I, Lebanese University, Lebanon, and Institute Camille Jordan Département de Mathématiques, Université Claude Bernard Lyon 1, France
Published: (2016) -
Maximally Spatial-Disjoint Lightpaths in Optical Networks
by: Ashraf, M. Waqar, et al.
Published: (2018) -
Finding the Limits of the Limes : Modelling Demography, Economy and Transport on the Edge of the Roman Empire
Published: (2019) -
Uniform edge betweenness centrality
by: Newman, Heather; Department of Mathematics Princeton University USA, et al.
Published: (2020) -
Direction-Finding Scheme For Multi Base Position Classification
by: S, Karpagavalli, et al.
Published: (2017)