BibTeX
CSL-JSON
MLA
Harvard
Cubic graphs with equal independence number and matching number
release_zoepwm2yxbforov2i3654dw6lq
by
Elena Mohr, Dieter Rautenbach
Released
as a article
.
2019
Abstract
Caro, Davila, and Pepper (arXiv:1909.09093) recently proved δ(G)
α(G)≤Δ(G) μ(G) for every graph G with minimum degree
δ(G), maximum degree Δ(G), independence number α(G), and
matching number μ(G). Answering some problems they posed, we characterize
the extremal graphs for δ(G)<Δ(G) as well as for
δ(G)=Δ(G)=3.
In text/plain
format
Archived Files and Locations
application/pdf 115.2 kB
file_xpeuhhqf3zcjfjcf6tkmvmyzre
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1910.11762v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links