Star forests, dominating sets and Ramsey-type problems
From MaRDI portal
Publication:1348128
DOI10.1016/S0012-365X(01)00046-2zbMath0994.05148OpenAlexW2170800107MaRDI QIDQ1348128
Sheila Ferneyhough, Ruth Haas, Gary MacGillivray, Denis Hanson
Publication date: 15 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00046-2
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)
Related Items
Maximum size of digraphs with some parameters ⋮ LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS ⋮ Inverting the Turán problem ⋮ An inequality that relates the size of a bipartite graph with its order and restrained domination number ⋮ Inverting the Turán problem with chromatic number ⋮ On the approximability of the maximum agreement subtree and maximum compatible tree problems ⋮ Maximum sizes of graphs with given domination parameters
This page was built for publication: Star forests, dominating sets and Ramsey-type problems
