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
We show that every C6C6-free graph GG has a C4C4-free, bipartite subgraph with at least 3e(G)/83e(G)...
Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (B H ,W H ). We ...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
AbstractLet H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H....
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph...
AbstractA graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent verti...
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...
A graph G is said to be H-saturated if G contains no subgraph isomorphic to H but the addition of an...
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...
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...
© Cambridge University Press 2020. Let c denote the largest constant such that every C6-free graph G...
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the siz...
We prove that every graph with maximum degree ∆ admits a partition of its edges into O(√∆) parts (as...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...
We show that every C6C6-free graph GG has a C4C4-free, bipartite subgraph with at least 3e(G)/83e(G)...
Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (B H ,W H ). We ...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
AbstractLet H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H....
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph...
AbstractA graph G is H-saturated if G does not contain H as a subgraph but for any nonadjacent verti...
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...
A graph G is said to be H-saturated if G contains no subgraph isomorphic to H but the addition of an...
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...
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...
© Cambridge University Press 2020. Let c denote the largest constant such that every C6-free graph G...
In this note, we answer the following question of Foucaud, Krivelevich and Perarnau. What is the siz...
We prove that every graph with maximum degree ∆ admits a partition of its edges into O(√∆) parts (as...
We say G is (Qn, Qm)-saturated if it is a maximal Qm-free subgraph of the n-dimensional hypercube Qn...
We show that every C6C6-free graph GG has a C4C4-free, bipartite subgraph with at least 3e(G)/83e(G)...
Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (B H ,W H ). We ...
AbstractA graph G is said to be F-saturated if G does not contain a copy of F as a subgraph and G+e ...
DOI
Add to ORKG