The strong chromatic index of sparse graphs (Q477679): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1997772282 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1301.1992 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nearly complete graphs decomposable into large induced matchings and their applications / 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: Induced matchings in bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5752590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A bound on the strong chromatic index of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4175585 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strong chromatic index of \(k\)-degenerate graphs / rank | |||
Normal rank |
Latest revision as of 10:03, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The strong chromatic index of sparse graphs |
scientific article |
Statements
The strong chromatic index of sparse graphs (English)
0 references
9 December 2014
0 references
combinatorial problems
0 references
strong edge-coloring
0 references
strong chromatic index
0 references
sparse graphs
0 references
0 references