Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628): 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.endm.2007.01.073 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078951525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labellings of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On labeling the vertices of products of complete graphs with distance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Products of Complete Graphs with a Condition at Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coloring problem on the \(n\)-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and circular distance two labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on a hypercube coloring problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hypercube coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542184 / 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: Labelling Cayley Graphs on Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance-labelling problem for hypercubes / rank
 
Normal rank

Latest revision as of 20:12, 25 June 2024

scientific article
Language Label Description Also known as
English
Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
scientific article

    Statements

    Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (English)
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references