On the compatibility between a graph and a simple order

Cites work

scientific article; zbMATH DE number 3307330 (Why is no real title available?)
scientific article; zbMATH DE number 3050845 (Why is no real title available?)
scientific article; zbMATH DE number 3093421 (Why is no real title available?)
A Class of Multivalent Functions
Foundational aspects of theories of measurement
Semiorders and a Theory of Utility Discrimination

Cited in

(36)

Incremental list coloring of graphs, parameterized by conservation
The total chromatic number of split-indifference graphs
Block-indifference graphs: characterization, structural and spectral properties
No-hole \(k\)-tuple \((r+1)\)-distant colorings
On nontransitive indifference
Clique graphs of time graphs
Unit representation of semiorders. I: Countable sets
Minimum proper interval graphs
Variable intervals model
A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
On properties of unit interval graphs with a perceptual motivation
On edge-colouring indifference graphs
Intransitive indifference with unequal indifference intervals
Stochastic semi-orders
Proper interval graphs and the guard problem
Some representation problems for semiorders
Characterizing and edge-colouring split-indifference graphs
On minimum rank and zero forcing sets of a graph
2-nested matrices: towards understanding the structure of circle graphs
An approximation result for a periodic allocation problem
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
Decompositions for the edge colouring of reduced indifference graphs.
A linear-time algorithm for proper interval graph recognition
No-hole \((r+1)\)-distant colorings
On JND representations of semiorders
Gridline indifference graphs
No-hole 2-distant colorings
Double Semiorders and Double Indifference Graphs
Circular-arc hypergraphs: rigidity via connectedness
Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations
2-role assignments on triangulated graphs.
Homogeneous families of semiorders and the theory of probabilistic consistency
Counting and enumerating unlabeled split-indifference graphs
On edge-colouring indifference graphs
Algorithms for finding disjoint path covers in unit interval graphs

This page was built for publication: On the compatibility between a graph and a simple order

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