An improved linear edge bound for graph linkages (Q1767622): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Highly linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen / 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: Q3333070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for 3-linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal function for contractions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-linked graphs / rank
 
Normal rank

Latest revision as of 19:36, 7 June 2024

scientific article
Language Label Description Also known as
English
An improved linear edge bound for graph linkages
scientific article

    Statements

    Identifiers