Akademska digitalna zbirka SLovenije - logo
(UM)
  • Crossing graphs of fiber-complemented graphs
    Tepeh, Aleksandra
    Fiber-complemented graphs form a vast non bipartite generalization of median graphs. Using a certain natural coloring of edges, induced by parallelism relation between prefibers of a ... fiber-complemented graph, we introduce the crossing graph of a fiber-complemented graph G as the graph whose vertices are colors, and two colors are adjacent if they cross on some induced 4-cycle in ▫$G$▫. We show that a fiber-complemented graph is 2-connected if and only if its crossing graph is connected. We characterize those fiber-complemented graphs whose crossing graph is complete, and also those whose crossing graph is chordal.
    Vir: Electronic notes in discrete mathematics [Elektronski vir]. - ISSN 1571-0653 (Vol. 28, 2007, str. 515-520)
    Vrsta gradiva - prispevek na konferenci
    Leto - 2007
    Jezik - angleški
    COBISS.SI-ID - 11370774

Vnos na polico