Covering Multigraphs With Bipartite Graphs
Journal of Graph Theory · 13.11.2026
DOI: 10.1002/jgt.70154 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 13.11.2026. Verfasst von Jaehoon Kim und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Gefördert von: POSCO TJ Park Foundation, National Research Foundation of Korea, Institute for Basic Science.
Abstract (Originalsprache)
Hansel's lemma states , where is a collection of bipartite graphs covering all the edges of . We generalize this lemma to the corresponding multigraph covering problem and the graphon covering problem. We also prove an upper bound on which shows that our generalization is asymptotically tight in some sense.
Förderung
- POSCO TJ Park Foundation
- National Research Foundation of Korea
- Institute for Basic Science
Zitieren
APA
Kim, J., & Lee, H. (2026). Covering Multigraphs With Bipartite Graphs. Journal of Graph Theory. https://doi.org/10.1002/jgt.70154
Vancouver
Kim J, Lee H. Covering Multigraphs With Bipartite Graphs. Journal of Graph Theory. 2026. doi:10.1002/jgt.70154
BibTeX
@article{Kim2026,
author = {Kim, Jaehoon and Lee, Hyunwoo},
title = {Covering Multigraphs With Bipartite Graphs},
journal = {Journal of Graph Theory},
year = {2026},
doi = {10.1002/jgt.70154}
}
EUVIMED