Isolation of non-triangle cycles in graphs
From MaRDI portal
Cites work
- A characterization of graphs with maximum k-clique isolation number
- A characterization of graphs with maximum cycle isolation number
- A note on the cycle isolation number of graphs
- A sharp upper bound on the cycle isolation number of graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Cycle isolation of graphs with small girth
- Disjoint isolating sets and graphs with maximum isolation number
- Graphs with isolation number equal to one third of the order
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3596896 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Introduction to ``Topics on Domination
- Isolation of \(k\)-cliques
- Isolation of \(k\)-cliques. II
- Isolation of cycles
- Isolation of regular graphs and \(k\)-chromatic graphs
- Isolation of regular graphs, stars and k-chromatic graphs
- Isolation of squares in graphs
- Isolation of the diamond graph
- On the cycle isolation number of triangle-free graphs
- Partial domination -- the isolation number of a graph
- Proof of a conjecture on isolation of cycles in graphs
- Proof of a conjecture on isolation of graphs dominated by a vertex
- Towards a theory of domination in graphs
- Vertex-edge domination in graphs
- Vertex-edge domination in graphs
This page was built for publication: Isolation of non-triangle cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7353749)
