A result on the 3-generalized connectivity of a graph and its line graph (Q1714044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs with prescribed connectivity and line graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4147995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of line-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pendant tree-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large generalized 3-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the spanning-tree packing number of lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized connectivity of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized connectivity of complete equipartition 3-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of Lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012590 / rank
 
Normal rank

Latest revision as of 01:24, 18 July 2024

scientific article
Language Label Description Also known as
English
A result on the 3-generalized connectivity of a graph and its line graph
scientific article

    Statements

    A result on the 3-generalized connectivity of a graph and its line graph (English)
    0 references
    0 references
    0 references
    31 January 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    generalized connectivity
    0 references
    line graph
    0 references
    0 references