Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a new proof of a theorem which characterizes the least possible number of components of a graph obtainable from G by splitting each vertex ξ into b(ξ) vertices
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
Let F be a set of graphs and for a graph G let F(G) and F (G) denote the maximum order of an induce...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
Given a set $\mathcal{F}$ of graphs, we call a copy of a graph in $\mathcal{F}$ an $\mathcal{F}$-gra...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
Let G = (V +s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers withSum dj = d(s...
AbstractLet G b e a finite graph. A polynomial P(G, x) associated with G is defined, and a formula f...
AbstractLet G be a finite loopless graph with vertex-set V(G) and edge-set E(G). Edmonds' problem is...
Let $G:=(V,E)$ be a simple graph; for $I\subseteq V$ we denote by $l(I)$ the number of components...
AbstractLet G be a finite group and let S be a generating subset of G. We give upper bounds for the ...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
AbstractLet G be a finite simple graph on n vertices with minimum degreeδ(G) ⩾ δ (n ≡ δ (mod 2)). Le...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
Let F be a set of graphs and for a graph G let F(G) and F (G) denote the maximum order of an induce...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
Given a set $\mathcal{F}$ of graphs, we call a copy of a graph in $\mathcal{F}$ an $\mathcal{F}$-gra...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
AbstractLet G be a finite directed graph, and s a specified vertex in G, such that the edge set of G...
Let G = (V +s,E) be a graph and let S = (d1, ..., dp) be a set of positive integers withSum dj = d(s...
AbstractLet G b e a finite graph. A polynomial P(G, x) associated with G is defined, and a formula f...
AbstractLet G be a finite loopless graph with vertex-set V(G) and edge-set E(G). Edmonds' problem is...
Let $G:=(V,E)$ be a simple graph; for $I\subseteq V$ we denote by $l(I)$ the number of components...
AbstractLet G be a finite group and let S be a generating subset of G. We give upper bounds for the ...
AbstractLet G be a graph on n vertices, i(G) the number of pairwise non-isomorphic induced subgraphs...
AbstractLet G be a finite simple graph on n vertices with minimum degreeδ(G) ⩾ δ (n ≡ δ (mod 2)). Le...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
AbstractLet G be a graph on X, and let f(x), g(x) be positive integers; several authors have given c...
Let F be a set of graphs and for a graph G let F(G) and F (G) denote the maximum order of an induce...
DOI
Add to ORKG