Distant irregularity strength of graphs (Q394284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2013.08.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067612866 / 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: A new upper bound for the total vertex irregularity strength of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On irregular total labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superfluous edges and exponential expansions of de Bruijn and Kautz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregularity strength of dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irregular networks, regular graphs and integer matrices with distinct row and column sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph irregularity strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: The irregularity strength of \(K_{m,m}\) is 4 for odd m / 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: A survey on the distance-colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moore graphs and beyond: a survey of the degree/diameter problem / 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: Irregularity strength of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575472 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Distant irregularity strength of graphs
scientific article

    Statements

    Distant irregularity strength of graphs (English)
    0 references
    0 references
    27 January 2014
    0 references
    0 references
    irregularity strength
    0 references
    irregular colouring
    0 references
    \(1,2,3\)-conjecture
    0 references
    \(1,2\)-conjecture
    0 references
    distant irregularity strength
    0 references
    total vertex irregularity strength
    0 references
    0 references