Other formats:
BibTeX
LaTeX
RIS
@article{1480299, author = {Hliněný, Petr and Thomassen, Carsten}, article_location = {Philadelphia}, article_number = {3}, doi = {http://dx.doi.org/10.1137/17M1137231}, keywords = {graph; crossing number; NP-hardness}, language = {eng}, issn = {0895-4801}, journal = {SIAM Journal on Discrete Mathematics}, title = {Deciding Parity of Graph Crossing Number}, url = {https://www.fi.muni.cz/~hlineny/papers/paritycross-SIAM.pdf}, volume = {32}, year = {2018} }
TY - JOUR ID - 1480299 AU - Hliněný, Petr - Thomassen, Carsten PY - 2018 TI - Deciding Parity of Graph Crossing Number JF - SIAM Journal on Discrete Mathematics VL - 32 IS - 3 SP - 1962-1965 EP - 1962-1965 PB - SIAM SN - 08954801 KW - graph KW - crossing number KW - NP-hardness UR - https://www.fi.muni.cz/~hlineny/papers/paritycross-SIAM.pdf L2 - https://www.fi.muni.cz/~hlineny/papers/paritycross-SIAM.pdf N2 - We prove that it is NP-hard to determine whether the crossing number of an input graph is even or odd. ER -
HLINĚNÝ, Petr and Carsten THOMASSEN. Deciding Parity of Graph Crossing Number. \textit{SIAM Journal on Discrete Mathematics}. Philadelphia: SIAM, 2018, vol.~32, No~3, p.~1962-1965. ISSN~0895-4801. Available from: https://dx.doi.org/10.1137/17M1137231.
|