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

Relating dissociation, independence, and matchings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
5
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Furthermore, using n p q r s s = + 2 + + + , we obtain s = □ Theorem 7 concerning the extremal graphs for Theorem 1 requires quite some technical preparation, which is why we postpone it to the end of this section. We proceed to the proof of the characterization of the extremal subcubic graphs for (1).…”
Section: Let G Dmentioning
confidence: 99%
See 4 more Smart Citations
“…Furthermore, using n p q r s s = + 2 + + + , we obtain s = □ Theorem 7 concerning the extremal graphs for Theorem 1 requires quite some technical preparation, which is why we postpone it to the end of this section. We proceed to the proof of the characterization of the extremal subcubic graphs for (1).…”
Section: Let G Dmentioning
confidence: 99%
“…Section 2. For cubic graphs though, our first main result is the following best possible improvement of (1). Note that the connected cubic graph K 4 satisfies (1) with equality.…”
mentioning
confidence: 91%
See 3 more Smart Citations