Crossref
Complexity of (p,q)-bipartition of planar and 1-planar graphs
Discrete Applied Mathematics · 2026-11 · 393 · 246-267
DOI: 10.1016/j.dam.2026.06.031 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-11. Verfasst von Cyriac Antony und 2 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: Indian Institute of Technology Madras, University Grants Commission.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Indian Institute of Technology Madras
- University Grants Commission
Zitieren
APA
Antony, C., Karve, A., & Mishra, S. (2026). Complexity of (p,q)-bipartition of planar and 1-planar graphs. Discrete Applied Mathematics, 393, 246-267. https://doi.org/10.1016/j.dam.2026.06.031
Vancouver
Antony C, Karve A, Mishra S. Complexity of (p,q)-bipartition of planar and 1-planar graphs. Discrete Applied Mathematics. 2026;393:246-267. doi:10.1016/j.dam.2026.06.031
BibTeX
@article{Antony2026,
author = {Antony, Cyriac and Karve, Abhimanyoo and Mishra, Sounaka},
title = {Complexity of (p,q)-bipartition of planar and 1-planar graphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {393},
pages = {246--267},
doi = {10.1016/j.dam.2026.06.031}
}
EUVIMED