Q2857369 (Q2857369): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 23:43, 6 July 2024

scientific article

Language	Label	Description	Also known as
English	No label defined	scientific article

Statements

scholarly article

0 references

Florent Foucaud

0 references

Sylvain Gravier

0 references

0 references

0 references

0 references

publication date

1 November 2013

0 references

full work available at URL

http://www.sciencedirect.com/science/article/pii/S1571065311001259

0 references

MaRDI profile type

MaRDI publication profile

0 references

Minimal identifying codes in trees and planar graphs with large girth

0 references

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.

0 references

Extremal cardinalities for identifying and locating-dominating codes in graphs

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

The Complexity of Multiterminal Cuts

0 references

Extremal graphs for the identifying code problem

0 references

On the size of identifying codes in triangle-free graphs

0 references

On graphs having a \(V\setminus \{x\}\) set as an identifying code

0 references

On a new class of codes for identifying vertices in graphs

0 references

On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\)

0 references

Line perfect graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2857369

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2857369&oldid=35358117"