scientific article; zbMATH DE number 3307330

Cited in

(only showing first 100 items - show all)

Compact distributed certification of geometric graph classes
The weak-toll function of a graph: axiomatic characterizations and first-order non-definability
On coloring problems with local constraints
On nontransitive indifference
Integral mixed unit interval graphs
Normal Helly circular-arc graphs and its subclasses
Unit and proper tube orders
A Subexponential Parameterized Algorithm for Proper Interval Completion
The subchromatic number of a graph
On the null-homotopy of bridged graphs
The weighted sitting closer to friends than enemies problem in the line
Recognizing unit multiple intervals is hard
Block-indifference graphs: characterization, structural and spectral properties
Random generation and enumeration of bipartite permutation graphs
-threshold and -tolerance chain graphs
Interval competition graphs of symmetric digraphs
Asteroidal triples of moplexes
Algorithms for finding disjoint path covers in unit interval graphs
Clique-width of path powers
On the minimum and maximum selective graph coloring problems in some graph classes
Treewidth and minimum fill-in on permutation graphs in linear time
Thinness of product graphs
Uniform embeddings for Robinson similarity matrices
Powers of cycles, powers of paths, and distance graphs
Satisfiability problems on intervals and unit intervals
Using contracted solution graphs for solving reconfiguration problems
Short models for unit interval graphs
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
On chordal proper circular arc graphs
On coloring problems with local constraints
Towards a comprehensive theory of conflict-tolerance graphs
A characterization of interval catch digraphs
A structural characterization for certifying Robinsonian matrices
Connected proper interval graphs and the guard problem in spiral polygons (extended abstract)
Simultaneous representation of proper and unit interval graphs
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Tangent circle graphs and `orders'
Minimal classes of graphs of unbounded clique-width
Fully dynamic recognition of proper circular-arc graphs
Characterization of classical graph classes by weighted clique graphs
Simple linear time recognition of unit interval graphs
A new representation of proper interval graphs with an application to clique-width
Representing a concept lattice by a graph
Graphs of linear clique-width at most 3
Double Semiorders and Double Indifference Graphs
On strict (outer-)confluent graphs
Structure theorems for some circular-arc graphs
Computing role assignments of proper interval graphs in polynomial time
On the unit interval graphs which are paired k-disjoint path coverable
Unit interval vertex deletion: fewer vertices are relevant
On strict (outer-)confluent graphs
NeST graphs
Tolerance graphs
Measuring indifference: unit interval vertex deletion
Chromatic quasisymmetric functions of directed graphs
Further hardness results on rainbow and strong rainbow connectivity
Characterizations and algorithmic applications of chordal graph embeddings
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Graphs of interval count two with a given partition
Unit and single point interval graphs
Finding Hamiltonian circuits in proper interval graphs
Proper interval vertex deletion
Subgraph isomorphism in graph classes
On-line chain partitions of orders: a survey
The co-secure domination in proper interval graphs
Graph classes and forbidden patterns on three vertices
Short proofs for interval digraphs
Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit
A new characterization of proper interval graphs
Single-cell 3D genome reconstruction in the haploid setting using rigidity theory
The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal
Tuple domination on graphs with the consecutive-zeros property
A characterization of interval orders with semiorder dimension two
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
Computing role assignments of proper interval graphs in polynomial time
Approximating the bandwidth for asteroidal triple-free graphs
Unit disk graph recognition is NP-hard
Similarity-first search: a new algorithm with application to Robinsonian matrix recognition
Graphs with at most two moplexes
A characterisation of rigid circuit graphs
Consecutive retrieval property -- revisited
On the classes of interval graphs of limited nesting and count of lengths
The difference between the metric dimension and the determining number of a graph
On edge transitivity of directed graphs
Separability generalizes Dirac's theorem
Simultaneous representation of proper and unit interval graphs
Moduli spaces of geometric graphs
Perfect elimination orderings for symmetric matrices
Some remarks on the geodetic number of a graph
A short proof that `proper = unit'
On the computation of the hull number of a graph
Gridline indifference graphs
Paired threshold graphs
Interval graphs and interval orders
Tractabilities and intractabilities on geometric intersection graphs
Weakly toll convexity and proper interval graphs
Reconstructibility and perfect graphs
Conditions for the representation of absolute judgment and pair comparison isosensitivity curves by cumulative distributions
Maximum Semiorders in Interval Orders

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5588432)