Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Intransitive indifference with unequal indifference intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chronological orderings of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Robert's inequality for boxicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intersections of interval graphs / rank
 
Normal rank

Revision as of 10:46, 14 June 2024

scientific article
Language Label Description Also known as
English
Computing the boxicity of a graph by covering its complement by cointerval graphs
scientific article

    Statements

    Computing the boxicity of a graph by covering its complement by cointerval graphs (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    intersection graph
    0 references
    interval graph
    0 references
    boxicity
    0 references
    edge coverings
    0 references