Implications among linkage properties in graphs (Q3633014): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Degree Implying That a Graph is H‐Linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sufficient Degree Conditions for a Graph to be $k$-linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for <i>H</i>‐linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum degree conditions for \(H\)-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore‐type degree conditions for a graph to be <i>H</i>‐linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear edge bound for graph linkages / rank
 
Normal rank

Latest revision as of 16:43, 1 July 2024

scientific article
Language Label Description Also known as
English
Implications among linkage properties in graphs
scientific article

    Statements