Powers of cycles, powers of paths, and distance graphs (Q531605): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q712274
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003844484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic numbers and fractional chromatic numbers of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic numbers of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4483922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring prime distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant graphs: recognizing and isomorphism testing in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Roberts characterization of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for proper interval graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of integer distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution of the isomorphism problem for circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circulant graphs of prime order in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing circulant graphs in polynomial time: An application of association schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number of prime distance graphs / rank
 
Normal rank

Latest revision as of 00:15, 4 July 2024

scientific article
Language Label Description Also known as
English
Powers of cycles, powers of paths, and distance graphs
scientific article

    Statements

    Powers of cycles, powers of paths, and distance graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 April 2011
    0 references
    0 references
    cycle
    0 references
    path
    0 references
    circulant graph
    0 references
    distance graph
    0 references
    circular arc graph
    0 references
    interval graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references