Exactly hittable interval graphs
type: Item
instance of: scholarly article
title: Exactly hittable interval graphs
zbMATH Open document ID: 1546.05145
author: S. M. Dhannya
author: N. S. Narayanaswamy
author: K. K. Nisha
published in: Discrete Mathematics and Theoretical Computer Science. DMTCS
publication date: 2024-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 7908430
zbMATH Keywords: exact hitting sets
zbMATH Keywords: interval graphs
zbMATH Keywords: forbidden structure characterization
MaRDI profile type: Publication
cites work: Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs
cites work: Conflict-free coloring: graphs of bounded clique width and intersection graphs
cites work: Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
cites work: Forbidden induced subgraph characterization of circle graphs within split graphs
cites work: LATIN 2004: Theoretical Informatics
cites work: On the stab number of rectangle intersection graphs
cites work: On rectangle intersection graphs with stab number at most two
cites work: Every planar graph is the intersection graph of segments in the plane
cites work: Strong conflict-free coloring for intervals
cites work: Online Conflict‐Free Coloring for Intervals
cites work: The strong perfect graph theorem
cites work: Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
cites work: Simple linear time recognition of unit interval graphs
cites work: Algorithms for four variants of the exact satisfiability problem
cites work: A linear-time algorithm for proper interval graph recognition
cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
cites work: Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs
cites work: Fundamentals of parameterized complexity
cites work: Faster exact solutions for some NP-hard problems.
cites work: New Results on Monotone Dualization and Generating Hypergraph Transversals
cites work: Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
cites work: Q5724800
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: The Representation of a Graph by Set Intersections
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: The Roberts characterization of proper and unit interval graphs
cites work: On partitioning interval graphs into proper interval subgraphs and related problems
cites work: Q4198056
cites work: Complexity of conflict-free colorings of graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A recognition algorithm for the intersection graphs of paths in trees
cites work: Interval graphs and related topics
cites work: Algorithmic graph theory and perfect graphs
cites work: Intersection models of weakly chordal graphs
cites work: Q3216686
cites work: Conflict-free coloring of points and simple regions in the plane
cites work: Q5572939
cites work: Conflict-Free Coloring Made Stronger
cites work: Conflict-free coloring of points on a line with respect to a set of intervals
cites work: Conflict-free coloring of intersection graphs of geometric objects
cites work: Computing and Combinatorics
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Conflict-free coloring of unit disks
cites work: Characterizing path graphs by forbidden induced subgraphs
cites work: Topics in Intersection Graph Theory
cites work: The Recognition of Tolerance and Bounded Tolerance Graphs
cites work: Intersection graphs of paths in a tree
cites work: Improved results on geometric hitting set problems
cites work: Coloring Axis-Parallel Rectangles
cites work: Conflict-Free Colourings of Graphs and Hypergraphs
cites work: Q3898496
cites work: Q3818127
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: On The Chromatic Number of Geometric Hypergraphs
cites work: Conflict-Free Coloring and its Applications
cites work: Q3011753
DOI: 10.46298/DMTCS.10762
description: scientific article; zbMATH DE number 7908430