@article{dmtcs:2152,
    title      = {An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size},
    author     = {De-Yan Zeng and Jian-Hua Yin},
    url        = {https://dmtcs.episciences.org/2152},
    doi        = {10.46298/dmtcs.2152},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 17 no. 3},
    issuetitle = {Graph Theory},
    eid        = 9,
    year       = {2016},
    month      = {Aug},
    keywords   = {2-trees., graphic sequences, realization, degree sequences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}