On the size of identifying codes in triangle-free graphs (Q427898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6047056 / rank
 
Normal rank
Property / zbMATH Keywords
 
identifying code
Property / zbMATH Keywords: identifying code / rank
 
Normal rank
Property / zbMATH Keywords
 
dominating set
Property / zbMATH Keywords: dominating set / rank
 
Normal rank
Property / zbMATH Keywords
 
triangle-free graph
Property / zbMATH Keywords: triangle-free graph / rank
 
Normal rank
Property / zbMATH Keywords
 
maximum degree
Property / zbMATH Keywords: maximum degree / rank
 
Normal rank

Revision as of 22:12, 29 June 2023

scientific article
Language Label Description Also known as
English
On the size of identifying codes in triangle-free graphs
scientific article

    Statements

    On the size of identifying codes in triangle-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    identifying code
    0 references
    dominating set
    0 references
    triangle-free graph
    0 references
    maximum degree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references