Structural properties of twin-free graphs
zbMATH Open1113.05085MaRDI QIDQ870075FDOQ870075
Authors: Irène Charon, Olivier Hudry, Iiro Honkala, Antoine Lobstein 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Induced paths in twin-free graphs
- On the number of optimal identifying codes in a twin-free graph
- Extremal values for identification, domination and maximum cliques in twin-free graphs.
- Minimum sizes of identifying codes in graphs differing by one vertex
- Minimum sizes of identifying codes in graphs differing by one edge
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Combinatorial codes (94B25)
Cited In (23)
- Twin subgraphs and core-semiperiphery-periphery structures
- On the ensemble of optimal identifying codes in a twin-free graph
- Some classifications of graphs with respect to a set adjacency relation
- On the number of optimal identifying codes in a twin-free graph
- Extremal values for identification, domination and maximum cliques in twin-free graphs.
- On the size of identifying codes in triangle-free graphs
- On the size of identifying codes in binary hypercubes
- 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
- Induced paths in twin-free graphs
- Locating-domination and identification
- Characterization theorems for the spaces of derivations of evolution algebras associated to graphs
- On Iiro Honkala's contributions to identifying codes
- Identifying path covers in graphs
- On cages admitting identifying codes
- Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
- Minimum sizes of identifying codes in graphs differing by one edge
- Twins in graphs
- The minimum number of maximal independent sets in twin-free graphs
- Minimum sizes of identifying codes in graphs differing by one vertex
- Extremal graphs for the identifying code problem
- On \(r\)-locating-dominating sets in paths
- Extremal values for the maximum degree in a twin-free graph.
This page was built for publication: Structural properties of twin-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870075)
