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
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vert...
AbstractIn this paper, we introduce a new property for graphs called bounded fragmentation, by which...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
AbstractLet G=(V,E) be a graph and r:V→Z+. An r-detachment of G is a graph H obtained by ‘splitting’...
We define a parameter which measures the proportion of vertices which must be removed from any graph...
We define a parameter which measures the proportion of vertices which must be removed from any graph...
AbstractWe define a parameter which measures the proportion of vertices which must be removed from a...
The paper presents several results on edge partitions and vertex partitions of graphs into graphs w...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
AbstractThe paper presents several results on edge partitions and vertex partitions of graphs into g...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...
AbstractFor every integer k⩾2 and graph G, consider the following natural procedure: if G has a comp...
For every integer k ≥ 2 and graph G, consider the following natural procedure: if G has a component ...
The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of...
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vert...
AbstractIn this paper, we introduce a new property for graphs called bounded fragmentation, by which...
Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a ne...
AbstractLet G=(V,E) be a graph and r:V→Z+. An r-detachment of G is a graph H obtained by ‘splitting’...
We define a parameter which measures the proportion of vertices which must be removed from any graph...
We define a parameter which measures the proportion of vertices which must be removed from any graph...
AbstractWe define a parameter which measures the proportion of vertices which must be removed from a...
The paper presents several results on edge partitions and vertex partitions of graphs into graphs w...
AbstractA finite graph F is a detachment of a finite graph G if G can be obtained from F by partitio...
AbstractThe paper presents several results on edge partitions and vertex partitions of graphs into g...
AbstractGiven an infinite graph G, let deg∞(G) be defined as the smallest d for which V(G) can be pa...
AbstractFor every integer k⩾2 and graph G, consider the following natural procedure: if G has a comp...
For every integer k ≥ 2 and graph G, consider the following natural procedure: if G has a component ...
The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of...
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vert...
AbstractIn this paper, we introduce a new property for graphs called bounded fragmentation, by which...
DOI
Add to ORKG