A note on tolerance graph recognition (Q1887065): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proper and unit tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite tolerance orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance graphs, and orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank

Revision as of 15:21, 7 June 2024

scientific article
Language Label Description Also known as
English
A note on tolerance graph recognition
scientific article

    Statements

    A note on tolerance graph recognition (English)
    0 references
    0 references
    0 references
    23 November 2004
    0 references
    A graph \(G=(V,E)\) is a tolerance graph if there is a set \(I=\{I_v\mid v\in V\}\) of closed real intervals and a set \(\tau=\{\tau_v\mid v\in V\}\) of positive real numbers such that \((X,Y)\in E\) if and only if \(|I_x\cap I_y|\geq \min\{\tau_x,\tau_y\}\), see [\textit{M. C. Golumbic, C. L. Monma} and \textit{W. T. Trotter} jun., Discrete Appl. Math. 9, 157--170 (1984; Zbl 0547.05054)].
    0 references
    tolerance representation
    0 references
    class NP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers