Paths, Stars and the Number Three
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Efficiency in exponential time for domination-type problems
- An upper bound on the domination number of a graph with minimum degree 2
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- The greedy algorithm for domination in graphs of maximum degree 3
- On certain spanning subgraphs of embeddings with applications to domination
- Pathwidth of cubic graphs and exact algorithms
- Graphs with large restrained domination number
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- On vertex-disjoint paths in regular graphs
- Pairs of disjoint dominating sets in connected cubic graphs
- On the domination number of graphs with minimum degree six
- Broadcast domination in subcubic graphs
- Ramsey-type results for path covers and path partitions
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- Minimum maximal matchings in cubic graphs
- Bounds on domination parameters in graphs: a brief survey
- Decreasing the maximum degree of a graph
- 2-limited broadcast domination in subcubic graphs
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- Outer independent double Roman domination
- Nontrivial path covers of graphs: existence, minimization and maximization
- On the minimum leaf number of cubic graphs
- Locating-dominating sets and identifying codes in graphs of girth at least 5
- General bounds on rainbow domination numbers
- Three-arc graphs: characterization and domination
- On the structure of dominating graphs
- On the differential and Roman domination number of a graph with minimum degree two
- Restricted domination parameters in graphs
- Domination in graphs of minimum degree at least two and large girth
- Domination in graphs of minimum degree five
- On domination in connected cubic graphs
- Domination number of graphs with minimum degree five
- A note on domination number in maximal outerplanar graphs
- A note on vertices contained in the minimum dominating set of a graph with minimum degree three
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Minimum degree and dominating paths
- Domination number of cubic graphs with large girth
- A note on the double Roman domination number of graphs.
- scientific article; zbMATH DE number 7217239 (Why is no real title available?)
- Double Roman domination
- On Domination Number of 4-Regular Graphs
- Signed and minus dominating functions in graphs
- Eternal and Secure Domination in Graphs
- Independent domination in cubic graphs
- Three tree-paths
- An upper bound for domination number of 5-regular graphs
- A linear vizing-like relation between the size and the domination number of a graph
- The \textsc{max quasi-independent set} problem
- scientific article; zbMATH DE number 1462928 (Why is no real title available?)
- Graphs with large total domination number
- Domination in planar graphs with small diameter*
- Combinatorics for smaller kernels: the differential of a graph
- Minimum independent dominating sets of random cubic graphs
- Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs
- On the domination number of a graph and its block graph
- Exact algorithms for minimum weighted dominating induced matching
- Domination versus disjunctive domination in graphs
- New results on \(k\)-independence of graphs
- Domination in Cubic Graphs of Large Girth
- My favorite domination conjectures in graph theory are bounded
- scientific article; zbMATH DE number 2230329 (Why is no real title available?)
- On the domination number of a graph and its total graph
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
- Note on the domination number of graphs with forbidden cycles of lengths not divisible by 3
- Induced path factors of regular graphs
- On the path partition number of 6‐regular graphs
- Partial domination in supercubic graphs
- Partial domination and irredundance numbers in graphs
- Domination number and feedback vertex number of complements of line graphs
- A note on bounds for the broadcast domination number of graphs
- On the path partition of graphs
- Further results on the \(j\)-independence number of graphs
- Packing 3-vertex paths in claw-free graphs and related topics
- Dominating sets, packings, and the maximum degree
- The extended dominating sets in graphs
- Best possible upper bounds on the restrained domination number of cubic graphs
- Domination of triangulated discs and maximal outerplanar graphs
- On roman, global and restrained domination in graphs
- The decycling number of a line graph
- Packing 2- and 3-stars into ( 2 , 3 )-regular graphs
- An upper bound on path cover number of regular graphs and its application to Hamiltonian cycle in tough graphs
- Identifying codes in graphs of given maximum degree: characterizing trees
- Domination parameters and added matchings
- Bounds on the k-conversion number
- The domination and independent domination numbers of some families of snarks
- Cycle partitions in dense regular digraphs and oriented graphs
- Face-hitting dominating sets in planar graphs
- Finding the minimum k-weighted dominating sets using heuristic algorithms
- On the domination number of graphs with minimum degree at least seven
- Dominating sets in plane triangulations
- Lower bounds on the differential of a graph
- Domination in 4-regular graphs with no induced 4-cycles
- Outer-independent triple Roman domination
- Identifying codes in triangle-free graphs of bounded maximum degree
- Faster edge coloring by partition sieving
- A note on domination and minus domination numbers in cubic graphs
- Domination number in graphs with minimum degree two
- Path decomposition of graphs with given path length
- On dominating sets of maximal outerplanar and planar graphs
- Data reductions and combinatorial bounds for improved approximation algorithms
This page was built for publication: Paths, Stars and the Number Three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715272)
