The list distinguishing number equals the distinguishing number for interval graphs (Q503677): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1509.04327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distinguishing numbers of trees and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-distinguishing colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List distinguishing parameters of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending precolorings to distinguish group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing colorings of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing labellings of group action on vector spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cartesian powers of graphs can be distinguished by two labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135588 / rank
 
Normal rank

Revision as of 07:31, 13 July 2024

scientific article
Language Label Description Also known as
English
The list distinguishing number equals the distinguishing number for interval graphs
scientific article

    Statements

    The list distinguishing number equals the distinguishing number for interval graphs (English)
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    distinguishing number
    0 references
    list distinguishing number
    0 references
    interval graph
    0 references

    Identifiers