Non-proper edge-colouring of graphs and hereditary graph properties (Q5236091): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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.2989/16073606.2017.1302516 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2605718691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey numbers for disjoint unions of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number for theta graph versus a clique of order three and four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decomposability of additive hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5449144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colouring of graphs and hereditary graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distant irregularity strength of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey numbers of large cycles versus odd wheels / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:46, 20 July 2024

scientific article; zbMATH DE number 7117203
Language Label Description Also known as
English
Non-proper edge-colouring of graphs and hereditary graph properties
scientific article; zbMATH DE number 7117203

    Statements

    Non-proper edge-colouring of graphs and hereditary graph properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    edge-colouring
    0 references
    non-proper colouring
    0 references
    hereditary graph property
    0 references
    maximum degree
    0 references

    Identifiers