Recognizing Cartesian graph bundles (Q1356477): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cartesian graph factorization at logarithmic cost per edge / 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: Q4294601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring cartesian‐product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graph bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic numbers of graph bundles over cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Classes of Graph Bundles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorability of graph bundles / 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

Revision as of 13:09, 27 May 2024

scientific article
Language Label Description Also known as
English
Recognizing Cartesian graph bundles
scientific article

    Statements

    Recognizing Cartesian graph bundles (English)
    0 references
    0 references
    0 references
    0 references
    25 November 1997
    0 references
    Graph bundles are extensions of covering graphs and graph products. The authors develop an algorithm that finds a representation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over a triangle-free simple base. The problem of recognizing graph bundles over general base remains open.
    0 references
    recognition
    0 references
    graph products
    0 references
    Cartesian graph bundle
    0 references
    0 references

    Identifiers