2-role assignments on triangulated graphs. (Q1401397): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Role colouring a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular equivalence: General theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Betweenness, orders and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the compatibility between a graph and a simple order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to determine if a graph has a 2-role assignment? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161356 / rank
 
Normal rank

Revision as of 08:52, 6 June 2024

scientific article
Language Label Description Also known as
English
2-role assignments on triangulated graphs.
scientific article

    Statements

    2-role assignments on triangulated graphs. (English)
    0 references
    0 references
    17 August 2003
    0 references
    indifference graphs
    0 references

    Identifiers