On the compatibility between a graph and a simple order
From MaRDI portal
Publication:2533745
DOI10.1016/0095-8956(71)90010-4zbMath0177.27003OpenAlexW2094338284MaRDI QIDQ2533745
Publication date: 1971
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(71)90010-4
Related Items (37)
Algorithms for finding disjoint path covers in unit interval graphs ⋮ Minimum proper interval graphs ⋮ 2-nested matrices: towards understanding the structure of circle graphs ⋮ Proper interval graphs and the guard problem ⋮ Solving the canonical representation and star system problems for proper circular-arc graphs in logspace ⋮ Gridline indifference graphs ⋮ No-hole \(k\)-tuple \((r+1)\)-distant colorings ⋮ On properties of unit interval graphs with a perceptual motivation ⋮ Characterizing and edge-colouring split-indifference graphs ⋮ Incremental list coloring of graphs, parameterized by conservation ⋮ On edge-colouring indifference graphs ⋮ Some representation problems for semiorders ⋮ Decompositions for the edge colouring of reduced indifference graphs. ⋮ 2-role assignments on triangulated graphs. ⋮ Counting and enumerating unlabeled split–indifference graphs ⋮ The total chromatic number of split-indifference graphs ⋮ On JND representations of semiorders ⋮ A linear-time algorithm for proper interval graph recognition ⋮ Unit representation of semiorders. I: Countable sets ⋮ Circular-arc hypergraphs: rigidity via connectedness ⋮ Stochastic semi-orders ⋮ No-hole \((r+1)\)-distant colorings ⋮ On minimum rank and zero forcing sets of a graph ⋮ An approximation result for a periodic allocation problem ⋮ A Lex-BFS-based recognition algorithm for Robinsonian matrices ⋮ Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations ⋮ Intransitive indifference with unequal indifference intervals ⋮ On nontransitive indifference ⋮ Homogeneous families of semiorders and the theory of probabilistic consistency ⋮ On edge-colouring indifference graphs ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs ⋮ Block-indifference graphs: characterization, structural and spectral properties ⋮ Double Semiorders and Double Indifference Graphs ⋮ Variable intervals model ⋮ Clique graphs of time graphs ⋮ No-hole 2-distant colorings
Cites Work
This page was built for publication: On the compatibility between a graph and a simple order
