Surface Embedding of Non-Bipartite $k$-Extendable Graphs
Cited by
Export citation
- BibTex
- RIS
- TXT
@Article{AAM-38-1,
author = {Lu , Hongliang and Wang , David G. L.},
title = {Surface Embedding of Non-Bipartite $k$-Extendable Graphs},
journal = {Annals of Applied Mathematics},
year = {2022},
volume = {38},
number = {1},
pages = {1--24},
abstract = {
For every surface, we find the minimum number $k$ such that every non-bipartite graph that is embeddable in that surface is not $k$-extendable. In particular, we construct a family of $3$-extendable graphs which we call bow-tie graphs. This confirms the existence of an infinite number of $3$-extendable non-bipartite graphs that are embeddable in the Klein bottle.
}, issn = {}, doi = {https://doi.org/10.4208/aam.OA-2021-0008}, url = {http://global-sci.org/intro/article_detail/aam/20171.html} }
TY - JOUR
T1 - Surface Embedding of Non-Bipartite $k$-Extendable Graphs
AU - Lu , Hongliang
AU - Wang , David G. L.
JO - Annals of Applied Mathematics
VL - 1
SP - 1
EP - 24
PY - 2022
DA - 2022/01
SN - 38
DO - http://doi.org/10.4208/aam.OA-2021-0008
UR - https://global-sci.org/intro/article_detail/aam/20171.html
KW - Non-bipartite graph, matching extension, surface embedding.
AB -
For every surface, we find the minimum number $k$ such that every non-bipartite graph that is embeddable in that surface is not $k$-extendable. In particular, we construct a family of $3$-extendable graphs which we call bow-tie graphs. This confirms the existence of an infinite number of $3$-extendable non-bipartite graphs that are embeddable in the Klein bottle.
Hongliang Lu & David G. L. Wang. (1970). Surface Embedding of Non-Bipartite $k$-Extendable Graphs.
Annals of Applied Mathematics. 38 (1).
1-24.
doi:10.4208/aam.OA-2021-0008
Copy to clipboard