OpenAlex
PricingAboutJobs
Log inGet started
Work

Bounds of the number of leaves of spanning trees

HTML PDF

Year: 2012
Type: article
Source: Journal of Mathematical Sciences
DOI: 10.1007/s10958-012-0881-5
Authors: A. V. Bankevich, D. V. Karpov
Institutions: St Petersburg University, St. Petersburg Department of Steklov Institute of Mathematics, Steklov Mathematical Institute
Language: English

Topic: Advanced Graph Theory Research
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: spanning trees, leaves, lower bounds, degree sequences, girth, extremal graph theory

Open Access status: green
OpenAlex ID: W2005687899
FWCI: 0.98
Cites: 14
Cited by: 9
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms