AbstractThe smallest number of vertices that have to be deleted from a graph G to obtain a bipartite subgraph is called the bipartite vertex frustration of G and denoted by ψ(G). In this paper, some extremal properties of this graph invariant are presented. Moreover, we present an exact formula for the bipartite vertex frustration of the corona product of graphs
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
AbstractLet Gσ=(V,E,σ) be a connected signed graph. Using the equivalence between signed graphs and ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
AbstractThe smallest number of vertices that have to be deleted from a graph G to obtain a bipartite...
The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bi...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
AbstractFor a fixed bipartite graph H and given α∈(0,1), we determine the threshold TH(α) which guar...
The aim of this note is to give an account of some recent results and state a number of conjectures ...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
We prove several results from different areas of extremal combinatorics, including complete or parti...
We prove several results from different areas of extremal combinatorics, including complete or parti...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
We prove several results from different areas of extremal combinatorics, including complete or parti...
We prove several results from different areas of extremal combinatorics, giving complete or partial ...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
AbstractLet Gσ=(V,E,σ) be a connected signed graph. Using the equivalence between signed graphs and ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
AbstractThe smallest number of vertices that have to be deleted from a graph G to obtain a bipartite...
The bipartiteness of a graph is the minimum number of vertices whose deletion from G results in a bi...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
AbstractFor a fixed bipartite graph H and given α∈(0,1), we determine the threshold TH(α) which guar...
The aim of this note is to give an account of some recent results and state a number of conjectures ...
AbstractBipartite edge frustration of a graph is defined as the smallest number of edges that have t...
We prove several results from different areas of extremal combinatorics, including complete or parti...
We prove several results from different areas of extremal combinatorics, including complete or parti...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
We prove several results from different areas of extremal combinatorics, including complete or parti...
We prove several results from different areas of extremal combinatorics, giving complete or partial ...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
Let G be a connected k-regular bipartite graph with bipartition $V(G) = X \cap Y$ and adjacency matr...
AbstractLet Gσ=(V,E,σ) be a connected signed graph. Using the equivalence between signed graphs and ...
Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges...
DOI
Add to ORKG