Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs (Q3439105): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4501549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4944992 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / 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: Labeling Chordal Graphs: Distance Two Condition / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s1571-0653(04)00594-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1971715041 / rank | |||
Normal rank |
Latest revision as of 11:57, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs |
scientific article |
Statements
Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs (English)
0 references
29 May 2007
0 references