Structural properties of twin-free graphs
From MaRDI portal
Publication:870075
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
05C35: Extremal problems in graph theory
05C75: Structural characterization of families of graphs
94B25: Combinatorial codes
Related Items
Characterization theorems for the spaces of derivations of evolution algebras associated to graphs, Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings, Some classifications of graphs with respect to a set adjacency relation, The difference between the metric dimension and the determining number of a graph, Identifying path covers in graphs, On the size of identifying codes in triangle-free graphs, On \(r\)-locating-dominating sets in paths, On the size of identifying codes in binary hypercubes, Twin subgraphs and core-semiperiphery-periphery structures, Minimum sizes of identifying codes in graphs differing by one edge, Minimum sizes of identifying codes in graphs differing by one vertex, On cages admitting identifying codes, Extremal graphs for the identifying code problem, Locating-Domination and Identification
