The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a class of Hamiltonian laceable 3-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Honeycomb toroidal graphs are Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Channel assignment on Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(h,1)\)-labeling subclasses of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / 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: Generalized honeycomb torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-dual configurations and regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Petersen graphs labeled with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / 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: Griggs and Yeh's Conjecture and $L(p,1)$-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $L(2,1)$-Labeling of Hamiltonian graphs with Maximum Degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem about the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(2,1)\)-labelings of Cartesian products of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling outerplanar graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized honeycomb torus is Hamiltonian / 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

Latest revision as of 13:17, 6 July 2024

scientific article
Language Label Description Also known as
English
The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
scientific article

    Statements

    The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (English)
    0 references
    0 references
    0 references
    0 references
    13 June 2013
    0 references
    0 references
    \(L(2,1)\)-labelling
    0 references
    \(\lambda\)-number
    0 references
    brick product
    0 references
    honeycomb toroidal graph
    0 references
    honeycomb torus
    0 references
    Cayley graph
    0 references
    dihedral group
    0 references
    0 references
    0 references
    0 references