Clique number of the square of a line graph (Q271628): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W1681279317 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1504.06585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424900 / 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: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in bipartite graphs / 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: Graph colouring and the probabilistic method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242948 / rank
 
Normal rank

Latest revision as of 18:49, 11 July 2024

scientific article
Language Label Description Also known as
English
Clique number of the square of a line graph
scientific article

    Statements

    Clique number of the square of a line graph (English)
    0 references
    7 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    strong chromatic index
    0 references
    clique number of the square of a line graph
    0 references
    fractional strong chromatic index
    0 references
    0 references
    0 references