Structural properties of twin-free graphs

zbMath1113.05085MaRDI QIDQ870075

Irène Charon, Olivier Hudry, Antoine C. Lobstein, Iiro S. Honkala

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/127478

zbMATH Keywords

path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25)

Related Items (14)

The difference between the metric dimension and the determining number of a graph ⋮ Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings ⋮ Minimum sizes of identifying codes in graphs differing by one vertex ⋮ Identifying path covers in graphs ⋮ On cages admitting identifying codes ⋮ Extremal graphs for the identifying code problem ⋮ On the size of identifying codes in triangle-free graphs ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Minimum sizes of identifying codes in graphs differing by one edge ⋮ Characterization theorems for the spaces of derivations of evolution algebras associated to graphs ⋮ Locating-Domination and Identification ⋮ On \(r\)-locating-dominating sets in paths ⋮ On the size of identifying codes in binary hypercubes ⋮ Some classifications of graphs with respect to a set adjacency relation

This page was built for publication: Structural properties of twin-free graphs