The strong chromatic index of a class of graphs (Q998363): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2007.11.051 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.11.051 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051010614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of a cubic graph is at most 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence and strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5475521 / 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: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2007.11.051 / rank
 
Normal rank

Latest revision as of 12:07, 10 December 2024

scientific article
Language Label Description Also known as
English
The strong chromatic index of a class of graphs
scientific article

    Statements

    The strong chromatic index of a class of graphs (English)
    0 references
    0 references
    0 references
    28 January 2009
    0 references
    strong edge coloring
    0 references
    strong chromatic index
    0 references
    induced matching
    0 references
    line graph
    0 references

    Identifiers