Paths, Stars and the Number Three
From MaRDI portal
Publication:4715272
DOI10.1017/S0963548300002042zbMath0857.05052OpenAlexW2112825968MaRDI QIDQ4715272
Publication date: 6 March 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300002042
Related Items (85)
Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Domination in planar graphs with small diameter* ⋮ Domination number in graphs with minimum degree two ⋮ Minimum independent dominating sets of random cubic graphs ⋮ Minimum maximal matchings in cubic graphs ⋮ On the domination number of a graph and its block graph ⋮ Domination in Cubic Graphs of Large Girth ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Double Roman domination ⋮ Independent Domination in Cubic Graphs ⋮ Path decomposition of graphs with given path length ⋮ Decreasing the maximum degree of a graph ⋮ Domination number of graphs with minimum degree five ⋮ A note on domination number in maximal outerplanar graphs ⋮ On the structure of dominating graphs ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ Pairs of disjoint dominating sets in connected cubic graphs ⋮ Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ Packing 3-vertex paths in claw-free graphs and related topics ⋮ Unnamed Item ⋮ 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 ⋮ On dominating sets of maximal outerplanar and planar graphs ⋮ A note on bounds for the broadcast domination number of graphs ⋮ On the path partition of graphs ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Domination number and Laplacian eigenvalue distribution ⋮ 2-limited broadcast domination in subcubic graphs ⋮ The \textsc{max quasi-independent set} problem ⋮ A note on vertices contained in the minimum dominating set of a graph with minimum degree three ⋮ Dominating sets, packings, and the maximum degree ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity ⋮ On roman, global and restrained domination in graphs ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ A note on the double Roman domination number of graphs ⋮ On covering vertices of a graph by trees ⋮ Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs ⋮ Restricted domination parameters in graphs ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ On vertex-disjoint paths in regular graphs ⋮ Exact algorithms for minimum weighted dominating induced matching ⋮ New results on \(k\)-independence of graphs ⋮ Domination in graphs of minimum degree at least two and large girth ⋮ Domination, radius, and minimum degree ⋮ A sharp upper bound on algebraic connectivity using domination number ⋮ Graphs with large total domination number ⋮ Dominating sets in plane triangulations ⋮ Domination in graphs of minimum degree five ⋮ Lower bounds on the differential of a graph ⋮ An upper bound for domination number of 5-regular graphs ⋮ On the domination number of graphs with minimum degree six ⋮ Outer independent double Roman domination ⋮ On Domination Number of 4-Regular Graphs ⋮ A linear vizing-like relation between the size and the domination number of a graph ⋮ Efficiency in exponential time for domination-type problems ⋮ Nontrivial path covers of graphs: existence, minimization and maximization ⋮ 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 ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Eternal and Secure Domination in Graphs ⋮ The greedy algorithm for domination in graphs of maximum degree 3 ⋮ Unnamed Item ⋮ Domination versus disjunctive domination in graphs ⋮ On the minimum leaf number of cubic graphs ⋮ Domination number of cubic graphs with large girth ⋮ Graphs with large restrained domination number ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Pathwidth of cubic graphs and exact algorithms ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Broadcast domination in subcubic graphs ⋮ Ramsey-type results for path covers and path partitions ⋮ On domination in connected cubic graphs ⋮ On the domination number of a graph and its total graph ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5 ⋮ General bounds on rainbow domination numbers ⋮ 2-limited dominating broadcasts on cubic graphs without induced 4-cycles ⋮ A note on domination and minus domination numbers in cubic graphs ⋮ Three-arc graphs: characterization and domination
Cites Work
This page was built for publication: Paths, Stars and the Number Three
