\(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11425-006-2029-x / rank | |||
Property / author | |||
Property / author: Zhong Fu Zhang / rank | |||
Property / author | |||
Property / author: Jing-wen Li / rank | |||
Property / author | |||
Property / author: Zhong Fu Zhang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jing-wen Li / rank | |||
Normal rank | |||
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.1007/s11425-006-2029-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2231031178 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adjacent strong edge coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on adjacent strong edge coloring of \(K(n,m)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3024948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5294976 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3815316 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complete chromatic number of some planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4016072 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4037761 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On adjacent-vertex-distinguishing total coloring of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4934402 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11425-006-2029-X / rank | |||
Normal rank |
Latest revision as of 06:10, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(D(\beta)\)-vertex-distinguishing total coloring of graphs |
scientific article |
Statements
\(D(\beta)\)-vertex-distinguishing total coloring of graphs (English)
0 references
16 February 2007
0 references
graph
0 references
total coloring
0 references