Factoring cartesian‐product graphs (Q4309984): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing equivalence classes among the edges of a graph with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Isometric Embeddings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Winkler's algorithm for factoring a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das schwache Kartesische Produkt von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4294601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring a graph in polynomial time / rank
 
Normal rank

Latest revision as of 18:17, 22 May 2024

scientific article; zbMATH DE number 665809
Language Label Description Also known as
English
Factoring cartesian‐product graphs
scientific article; zbMATH DE number 665809

    Statements

    Factoring cartesian‐product graphs (English)
    0 references
    0 references
    0 references
    18 April 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    equivalence relation
    0 references
    Cartesian product
    0 references
    prime graphs
    0 references
    prime factorization
    0 references
    distances
    0 references
    convex hull
    0 references
    0 references