No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (Q879397): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.09.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071315514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Span of No-Hole (<i>r</i>+1)-Distant Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance graphs and \(T\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labellings of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The channel assignment problem for mutually adjacent sites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every connected regular graph of even degree is a Schreier coset graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings and \(T\)-edge spans of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite locally-quasiprimitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-graphs and the channel assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotic Approach to the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on T-Coloring and Frequency Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole 2-distant colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole \((r+1)\)-distant colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole \(k\)-tuple \((r+1)\)-distant colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A channel assignment problem for optical networks modelled by Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local analysis of imprimitive symmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Cayley Graphs on Abelian Groups / rank
 
Normal rank

Latest revision as of 18:57, 25 June 2024

scientific article
Language Label Description Also known as
English
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
scientific article

    Statements

    No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups (English)
    0 references
    11 May 2007
    0 references
    0 references
    channel assignment
    0 references
    \(t\)-coloring
    0 references
    0 references
    0 references
    0 references
    0 references