2015
DOI: 10.1016/j.dam.2013.12.014
|View full text |Cite
|
Sign up to set email alerts
|

Best monotone degree conditions for binding number and cycle structure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…In this section, we consider best monotone degree conditions for P 1 ⇒ P 2 , where P 1 , P 2 are monotone increasing graph properties. Conditions of this type were first considered in [16]. A framework for such considerations is given in Section 2 upon substituting P 1 ⇒ P 2 for P throughout.…”
Section: Usingmentioning
confidence: 99%
“…In this section, we consider best monotone degree conditions for P 1 ⇒ P 2 , where P 1 , P 2 are monotone increasing graph properties. Conditions of this type were first considered in [16]. A framework for such considerations is given in Section 2 upon substituting P 1 ⇒ P 2 for P throughout.…”
Section: Usingmentioning
confidence: 99%