AbstractWe give an upper bound for ω(A), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G. We also give an upper bound for ω(A) when G is triangle-free. We show that these two bounds are best possible. Similar results are obtained for A to be a matching of G
AbstractA cycle-separated tricyclic graph (CSTC graph) is a connected simple graph with n vertices a...
AbstractWe provide a formula for the number of edges of a maximum induced matching in a graph. As ap...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
AbstractWe give an upper bound for ω(A), the minimum cyclomatic number of connected induced subgraph...
AbstractFor a given planar graph G with a set A of independent vertices, we provide a best-possible ...
AbstractFor a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number o...
AbstractFor a given planar graph G with a set A of independent vertices, we provide a best-possible ...
AbstractWe prove that every graph G of maximum degree at most 3 satisfies 32α(G)+α′(G)+12t(G)≥n(G), ...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(G) ...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractThe essential cyclomatic number of a hypergraph is the maximum number of independent essenti...
International audienceWe prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+...
International audienceWe prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+...
AbstractA cycle-separated tricyclic graph (CSTC graph) is a connected simple graph with n vertices a...
AbstractWe provide a formula for the number of edges of a maximum induced matching in a graph. As ap...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
AbstractWe give an upper bound for ω(A), the minimum cyclomatic number of connected induced subgraph...
AbstractFor a given planar graph G with a set A of independent vertices, we provide a best-possible ...
AbstractFor a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number o...
AbstractFor a given planar graph G with a set A of independent vertices, we provide a best-possible ...
AbstractWe prove that every graph G of maximum degree at most 3 satisfies 32α(G)+α′(G)+12t(G)≥n(G), ...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractLet G be a graph on n vertices. We show that if the total number of isomorphism types of ind...
A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(G) ...
Let G be a graph on n vertices. We show that if the total number of isomorphism types of induced sub...
AbstractThe essential cyclomatic number of a hypergraph is the maximum number of independent essenti...
International audienceWe prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+...
International audienceWe prove that any graph $G$ of minimum degree greater than $2k^2-1$ has a $(k+...
AbstractA cycle-separated tricyclic graph (CSTC graph) is a connected simple graph with n vertices a...
AbstractWe provide a formula for the number of edges of a maximum induced matching in a graph. As ap...
AbstractFor a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G th...
DOI
Add to ORKG