Pages that link to "Item:Q2032857"
From MaRDI portal
The following pages link to Matching and edge-connectivity in graphs with given maximum degree (Q2032857):
Displaying 13 items.
- Generalization of Erdős-Gallai edge bound (Q458592) (← links)
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- Matching and edge-connectivity in regular graphs (Q616391) (← links)
- On maximal matchings of connected graphs (Q812460) (← links)
- A characterization of graphs with given maximum degree and smallest possible matching number. II (Q2065903) (← links)
- A generalization of Petersen's matching theorem (Q2111920) (← links)
- Reducing the maximum degree of a graph: comparisons of bounds (Q3380399) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← links)
- Maximal matchings in graphs with large neighborhoods of independent vertices (Q4713005) (← links)
- (Q4729838) (← links)
- (Q5703681) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- A complete description of convex sets associated with matchings and edge‐connectivity in graphs (Q6046646) (← links)