Abstract.Let 𝐺 = (𝑉, 𝐸) be a simple graph without isolated vertices and minimum degree 𝛿(𝐺), and let 𝑘 ∈ {1-[𝛿(𝐺)/2,...,[𝛿(𝐺)/2} be an ...
SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES
Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...
Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory. The study of crossing ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback