Q2708794 (Q2708794): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal matchings in graphs with given minimal and maximal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On critically h-connected simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of \((k,l)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über den Zusammenhang von Graphen, mit Anwendung auf symmetrische Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Zusammenhangsstruktur symmetrischer Graphen. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-critical connected line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizaions of critical connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-critical, n-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination-balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locally \(k\)-critically \(n\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fragments in 2-critically \(n\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the decomposition of graphs into cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank

Revision as of 16:02, 3 June 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    8 January 2002
    0 references
    0 references
    connectivity
    0 references
    fragment
    0 references
    atom
    0 references
    strongly regular
    0 references
    edge-transitive
    0 references
    vertex-transitive
    0 references
    factor
    0 references