The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree

Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo

Open source

DOI
10.1016/j.dam.2013.10.028
Published
2014
Container
Discrete Applied Mathematics
Publisher
Not recorded
Open access
yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/j.dam.2013.10.028,
  title = {The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree},
  author = {Weihua Yang and Yingzhi Tian and Hengzhe Li and Hao Li and Xiaofeng Guo},
  year = {2014},
  journal = {Discrete Applied Mathematics},
  doi = {10.1016/j.dam.2013.10.028},
  url = {https://doi.org/10.1016/j.dam.2013.10.028}
}

RIS

TY  - JOUR
TI  - The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree
AU  - Weihua Yang
AU  - Yingzhi Tian
AU  - Hengzhe Li
AU  - Hao Li
AU  - Xiaofeng Guo
PY  - 2014
JO  - Discrete Applied Mathematics
DO  - 10.1016/j.dam.2013.10.028
UR  - https://doi.org/10.1016/j.dam.2013.10.028
ER  - 

APA

Yang, W., Tian, Y., Li, H., Li, H., & Guo, X. (2014). The minimum restricted edge-connected graph and the minimum size of graphs with a given edge–degree. Discrete Applied Mathematics. https://doi.org/10.1016/j.dam.2013.10.028

Source records