Recognizing locally equivalent graphs (Q685658): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph Decompositions and Eulerian Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing prime graphs and recognizing circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic presentations of isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming trees by successive local complementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte-Martin polynomials and orienting vectors of isotropic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm to recognize locally equivalent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank
 
Normal rank

Revision as of 09:55, 22 May 2024

scientific article
Language Label Description Also known as
English
Recognizing locally equivalent graphs
scientific article

    Statements

    Recognizing locally equivalent graphs (English)
    0 references
    0 references
    24 October 1993
    0 references
    simple graph
    0 references
    locally equivalent graphs
    0 references
    polynomial algorithm
    0 references

    Identifiers