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
Filter
  • weakly chordal  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 11 (1995), S. 249-254 
    ISSN: 1435-5914
    Keywords: perfect ; minimal imperfect ; Berge ; star cutset ; unbreakable ; disc ; weakly chordal ; weakly triangulated
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We show that every vertex in an unbreakable graph is in a disc, where a disc is a chordless cycle, or the complement of a chordless cycle, with at least five vertices. A corollary is that every vertex in a minimal imperfect graph is in a disc.
    Type of Medium: Electronic Resource
    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...