Convexity in Graphs and Hypergraphs (Q3718757): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56387984, #quickstatements; #temporary_batch_1712186161777
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Partitions in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meet-distributive lattices and the anti-exchange closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of ptolemaic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tietze's convexity theorem for semilattices and lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4080169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving covering problems and the uncapacitated plant location problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5338702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, connected domination and strongly chordal graphs / rank
 
Normal rank

Latest revision as of 12:45, 17 June 2024

scientific article
Language Label Description Also known as
English
Convexity in Graphs and Hypergraphs
scientific article

    Statements

    Convexity in Graphs and Hypergraphs (English)
    0 references
    0 references
    0 references
    1986
    0 references
    convexity
    0 references
    chordal graphs
    0 references
    hypergraphs
    0 references

    Identifiers