Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed case on 1-2-3 conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coloring of graphs by total 2-weightings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-coloring 2-edge-weighting of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total-neighbor-distinguishing index by sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1,2 conjecture-the multiplicative version / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound on edge weight choosability of graphs / rank
 
Normal rank

Latest revision as of 12:23, 22 July 2024

scientific article
Language Label Description Also known as
English
Neighbour-distinguishing labellings of powers of paths and powers of cycles
scientific article

    Statements

    Neighbour-distinguishing labellings of powers of paths and powers of cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2020
    0 references
    1, 2 conjecture
    0 references
    powers of paths
    0 references
    powers of cycles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references