Max point-tolerance graphs (Q344833): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex Intersection Graphs of Paths on a Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring and Maximum Independent Set of Rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilateral L-Contact Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs as VPG-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Triangle Contact Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitioning of interval graphs with submodular costs on the cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of curves in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3344239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / 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: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-tolerance graphs as intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum clique cover and other hard problems in subtree filament graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and Geometric Properties of Planar Laman Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring relatives of intervals on the plane. I: Chromatic number versus girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination on Cocomparability Graphs / 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 weighted min-max relation for intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A digraph represented by a family of boxes or spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms to recognize outerplanar and maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of interval catch digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for interval catch digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Vertex- and Edge-Coloring of Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the graphs with boxicity \(\leq 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal ray graphs / rank
 
Normal rank

Latest revision as of 00:33, 13 July 2024

scientific article
Language Label Description Also known as
English
Max point-tolerance graphs
scientific article

    Statements

    Max point-tolerance graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tolerance graphs
    0 references
    interval graphs
    0 references
    L-graphs
    0 references
    rectangle intersection graphs
    0 references
    outerplanar graphs
    0 references
    weighted independent set
    0 references
    coloring
    0 references
    clique cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references