On decomposing regular graphs into locally irregular subgraphs (Q2349960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex colouring edge partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-colouring edge-weightings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregular Assignments of Trees and Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly irregular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Define an Irregular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence and chromatic numbers of random regular graphs / 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: A New Upper Bound for the Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Irregularity Strength of Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Bound on the Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on neighbour-distinguishing regular graphs total-weighting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vertex-coloring 13-edge-weighting / rank
 
Normal rank

Latest revision as of 05:40, 10 July 2024

scientific article
Language Label Description Also known as
English
On decomposing regular graphs into locally irregular subgraphs
scientific article

    Statements

    On decomposing regular graphs into locally irregular subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2015
    0 references
    locally irregular graph
    0 references

    Identifiers