z-logo
open-access-imgOpen Access
Spanning trees with a bounded number of branch vertices in a K1,4-free graph
Author(s) -
Dang Dinh Hanh
Publication year - 2021
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.2419
Subject(s) - mathematics , combinatorics , bounded function , spanning tree , trémaux tree , graph , discrete mathematics , minimum degree spanning tree , line graph , pathwidth , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom