Isolation of regular graphs and \(k\)-chromatic graphs
From MaRDI portal
Publication:6591055
DOI10.1007/s00009-024-02680-7zbMATH Open1543.05094MaRDI QIDQ6591055
Publication date: 21 August 2024
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Total domination in maximal outerplanar graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Total domination in maximal outerplanar graphs. II.
- On dominating sets of maximal outerplanar and planar graphs
- A combinatorial theorem in plane geometry
- Dominating sets in planar graphs
- On dominating sets of maximal outerplanar graphs
- Isolation of \(k\)-cliques. II
- Isolation of cycles
- Isolation of \(k\)-cliques
- Partial domination of maximal outerplanar graphs
- Isolation number of maximal outerplanar graphs
- Semipaired domination in maximal outerplanar graphs
- Total dominating sets in maximal outerplanar graphs
- Dominating sets of maximal outerplanar graphs
- Extensions of the Art Gallery Theorem
- Towards a theory of domination in graphs
- Partial domination - the isolation number of a graph
Related Items (1)
This page was built for publication: Isolation of regular graphs and \(k\)-chromatic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591055)