Towards a comprehensive theory of conflict-tolerance graphs (Q1759850): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.12.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030634141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Graphs with Containment Restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum independent set and maximum clique algorithms for overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Is between Chordal and Weakly Chordal Graphs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the boxicity of a graph by covering its complement by cointerval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection representation of complete unbalanced bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2869323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set intersection representations for almost all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subtree filament graphs are subtree overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets and cliques in intersection graphs of filaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and vertex intersection of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank‐tolerance graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Archimedean ϕ ‐tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and the complete hierarchy of intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing edge intersection graphs of paths on degree 4 trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection models of weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of multiple interval graphs and overlap graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\phi\)-threshold and \(\phi\)-tolerance chain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General results on tolerance intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3636145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance intersection graphs on binary trees with constant tolerance 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant tolerance intersection graphs of subtrees of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3581880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Sperner's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding maximum cliques of an overlap graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Robert's inequality for boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of chordal graphs as subtrees of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311854 / rank
 
Normal rank

Latest revision as of 22:39, 5 July 2024

scientific article
Language Label Description Also known as
English
Towards a comprehensive theory of conflict-tolerance graphs
scientific article

    Statements

    Towards a comprehensive theory of conflict-tolerance graphs (English)
    0 references
    0 references
    22 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    intersection graphs
    0 references
    interval graphs
    0 references
    graph representations
    0 references
    minimal forbidden subgraphs
    0 references
    trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references