AbstractLet H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e∈E(K)⧹E(G),G∪{e} is not H-free. We present some general results on Ks,t-saturated subgraphs of the complete bipartite graph Km,n and study the problem of finding, for all possible values of q, a C4-saturated subgraph of Km,n having precisely q edges
Let GG be a bipartite graph, and let HH be a bipartite graph with a fixed bipartition (BH,WH)(BH,WH)...
This dissertation considers several problems in extremal graph theory with the aim of finding the ma...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph...
AbstractLet H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H....
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and add...
© 2021 Society for Industrial and Applied Mathematics.This paper considers an edge minimization prob...
Let F and H be fixed graphs and let G be a spanning subgraph of H. G is an F-free subgraph of H if F...
AbstractA graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent verti...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...
© Cambridge University Press 2020. Let c denote the largest constant such that every C6-free graph G...
A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the...
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F-free for any ...
Let F and H be graphs. A subgraph G of H is an F-saturated subgraph of H if F is not a subgraph of G...
A graph is called H-free if it contains no copy of H. Let ex(n,H) denote the Turán number for H, i....
Let GG be a bipartite graph, and let HH be a bipartite graph with a fixed bipartition (BH,WH)(BH,WH)...
This dissertation considers several problems in extremal graph theory with the aim of finding the ma...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph...
AbstractLet H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H....
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and add...
© 2021 Society for Industrial and Applied Mathematics.This paper considers an edge minimization prob...
Let F and H be fixed graphs and let G be a spanning subgraph of H. G is an F-free subgraph of H if F...
AbstractA graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent verti...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...
© Cambridge University Press 2020. Let c denote the largest constant such that every C6-free graph G...
A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the...
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F-free for any ...
Let F and H be graphs. A subgraph G of H is an F-saturated subgraph of H if F is not a subgraph of G...
A graph is called H-free if it contains no copy of H. Let ex(n,H) denote the Turán number for H, i....
Let GG be a bipartite graph, and let HH be a bipartite graph with a fixed bipartition (BH,WH)(BH,WH)...
This dissertation considers several problems in extremal graph theory with the aim of finding the ma...
Given a family of graphs F, a graph G is F-saturated if no element of F is a subgraph of G, but for ...
DOI
Add to ORKG