Locally identifying colourings for graphs with given maximum degree (Q418899): 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: W1998597471 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1108.2769 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing edge colorings of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-distinguishing proper edge-colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4886768 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4794375 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a new class of codes for identifying vertices in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: <i>k</i>-Degenerate Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal cardinalities for identifying and locating-dominating codes in graphs / rank | |||
Normal rank |
Latest revision as of 06:25, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Locally identifying colourings for graphs with given maximum degree |
scientific article |
Statements
Locally identifying colourings for graphs with given maximum degree (English)
0 references
30 May 2012
0 references
graph colouring
0 references
identification
0 references
maximum degree
0 references
chordal graphs
0 references