Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation (Journal Article) | NSF PAGES

skip to main content

Citation Details

This content will become publicly available on January 1, 2024

Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation

Award ID(s):: 1954054 1929851

NSF-PAR ID:: 10404567

Author(s) / Creator(s):: Liu, Chun-Hung; Muzi, Irene

Date Published:: 2023-01-01

Journal Name:: Journal of Combinatorial Theory, Series B

Volume:: 158

Issue:: P1

ISSN:: 0095-8956

Page Range / eLocation ID:: 210 to 251

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on January 1, 2024
Journal Article:
https://doi.org/10.1016/j.jctb.2022.08.007