Characterization of common-edge sigraph (Q385160): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Common-edge sigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity in \(P_k\)-path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4774071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphisms of \(P_{k}\)-graphs for \(k \geqslant 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 03:30, 7 July 2024

scientific article
Language Label Description Also known as
English
Characterization of common-edge sigraph
scientific article

    Statements

    Characterization of common-edge sigraph (English)
    0 references
    0 references
    0 references
    0 references
    29 November 2013
    0 references
    0 references
    sigraph
    0 references
    common-edge graph
    0 references
    iterated line sigraph
    0 references
    common-edge sigraph
    0 references
    0 references