AbstractBounds are obtained for the number of vertices in a largest induced forest in a cubic graph with large girth. In particular, as girth increases without bound, the ratio of the number of vertices in a largest induced forest to the number of vertices in the whole graph approaches 34
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
A linear forest is a graph that connected components are chordless paths. A linear partition of a gr...
AbstractBounds are obtained for the number of vertices in a largest induced forest in a cubic graph ...
AbstractLet t(G) denote cardinality of a maximum induced forest of a graph G with n vertices. For co...
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induce...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractLet t(G) denote cardinality of a maximum induced forest of a graph G with n vertices. For co...
AbstractThis paper deals with the enumeration of distinct embeddings (both induced and partial) of a...
AbstractLet t(G) be the maximum size of a subset of vertices of a graph G that induces a tree. We in...
AbstractRecently Chen et al. [Tree domination in graphs, Ars Combin. 73 (2004) 193–203] asked for ch...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
A linear forest is a graph that connected components are chordless paths. A linear partition of a gr...
AbstractBounds are obtained for the number of vertices in a largest induced forest in a cubic graph ...
AbstractLet t(G) denote cardinality of a maximum induced forest of a graph G with n vertices. For co...
We proved that every planar triangle-free graph with n vertices has a subset of vertices that induce...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
We proved that every planar triangle-free graph of order n has a subset of vertices that induces a f...
AbstractLet t(G) denote cardinality of a maximum induced forest of a graph G with n vertices. For co...
AbstractThis paper deals with the enumeration of distinct embeddings (both induced and partial) of a...
AbstractLet t(G) be the maximum size of a subset of vertices of a graph G that induces a tree. We in...
AbstractRecently Chen et al. [Tree domination in graphs, Ars Combin. 73 (2004) 193–203] asked for ch...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of s...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n ...
A linear forest is a graph that connected components are chordless paths. A linear partition of a gr...
DOI
Add to ORKG