On the compatibility between a graph and a simple order

Cites Work

Semiorders and a Theory of Utility Discrimination
Title not available (Why is that?)
Foundational aspects of theories of measurement
Title not available (Why is that?)
Title not available (Why is that?)
A Class of Multivalent Functions

Cited In (37)

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

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)