Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 16 (2000), S. 381-387 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. A 4-uniform hypergraph represents the P 4-structure of a graph G if its hyperedges are the vertex sets of the P 4's in G. By using the weighted 2-section graph of the hypergraph we propose a simple efficient algorithm to decide whether a given 4-uniform hypergraph represents the P 4-structure of a bipartite graph without 4-cycle and 6-cycle. For trees, our algorithm is different from that given by G. Ding and has a better running time namely O(n 2) where n is the number of vertices.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Periodica mathematica Hungarica 27 (1993), S. 105-124 
    ISSN: 1588-2829
    Keywords: Primary 05C99 ; Gallai graphs ; iterated graph-valued functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a finite or infinite graphG, theGallai graph Γ(G) ofG is defined as the graph whose vertex set is the edge setE(G) ofG; two distinct edges ofG are adjacent in Γ(G) if they are incident but do not span a triangle inG. For any positive integert, thetth iterated Gallai graph Γ t (G) ofG is defined by Γ(Γ t−1(G)), where Γ0(G):=G. A graph is said to beGallai-mortal if some of its iterated Gallai graphs finally equals the empty graph. In this paper we characterize Gallai-mortal graphs in several ways.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Book
    Book
    Philadelphia, PA :SIAM,
    Title: Graph classes : a survey; 3
    Author: Brandstädt, Andreas
    Contributer: Le, Van Bang , Spinrad, Jeremy P.
    Publisher: Philadelphia, PA :SIAM,
    Year of publication: 1999
    Pages: 304 S.
    Series Statement: Monographs on discrete mathematics and applications 3
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...