Implications among linkage properties in graphs
From MaRDI portal
Publication:3633014
Recommendations
Cites work
- An extremal problem for H‐linked graphs
- An improved linear edge bound for graph linkages
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Minimum degree conditions for H-linked graphs
- On Minimum Degree Implying That a Graph is H‐Linked
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- On \(H\)-linked graphs
- Ore‐type degree conditions for a graph to be H‐linked
Cited in
(4)
This page was built for publication: Implications among linkage properties in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633014)