Minimum degree condition for a graph to be knitted (Q2324511): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963107223 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.07482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for <i>k</i>‐ordered hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / 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 the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture / 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: Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture / 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: 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: Über trennende Eckenmengen in homomorphiekritischen 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: An improved linear edge bound for graph linkages / rank
 
Normal rank

Latest revision as of 10:48, 20 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree condition for a graph to be knitted
scientific article

    Statements

    Minimum degree condition for a graph to be knitted (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2019
    0 references
    graph linkage
    0 references
    minimum degree
    0 references
    contraction-critical graphs
    0 references
    connectivity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references