Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Cheolwon Heo"'
Publikováno v:
The Electronic Journal of Combinatorics. 30
We show that for every binary matroid $N$ there is a graph $H_*$ such that for the graphic matroid $M_G$ of a graph $G$, there is a matroid-homomorphism from $M_G$ to $N$ if and only if there is a graph-homomorphism from $G$ to $H_*$. With this we pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a06fdafcc6497e15de67fc382da2ce36
https://doi.org/10.37236/11119
https://doi.org/10.37236/11119
Autor:
Bertrand Guenin, Cheolwon Heo
Publikováno v:
Mathematical Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79761c60d31323a9dcd37f7033751e27
https://doi.org/10.1007/s10107-023-01944-6
https://doi.org/10.1007/s10107-023-01944-6
Autor:
Bertrand Guenin, Cheolwon Heo
Publikováno v:
Mathematical Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::080ad1a79af5d16956fd23af9bbc771e
https://doi.org/10.1007/s10107-023-01951-7
https://doi.org/10.1007/s10107-023-01951-7
Autor:
Bertrand Guenin, Cheolwon Heo
Publikováno v:
Mathematical Programming.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::907bb935b4a1e4d5d65dd75137e7952e
https://doi.org/10.1007/s10107-023-01950-8
https://doi.org/10.1007/s10107-023-01950-8
Autor:
Cheolwon Heo, Bertrand Guenin
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
Even-cycle matroids are elementary lifts of graphic matroids. Even-cut matroids are elementary lifts of cographic matroids. We give a polynomial time algorithm to check if a binary matroid is an even-cycle matroid. We also give a polynomial time algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a18d2c48e2e82f48bd657eacfcdce7f8
https://doi.org/10.1007/978-3-030-45771-6_15
https://doi.org/10.1007/978-3-030-45771-6_15
