Results 241 to 250 of about 39,296 (257)
Some of the next articles are maybe not open access.
2005
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a K r subgraph for some given r?
openaire +1 more source
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a K r subgraph for some given r?
openaire +1 more source
Journal of Graph Theory, 1993
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
Extremal Bicyclic 3-Chromatic Graphs
Graphs and Combinatorics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomescu, Ioan, Javed, Sana
openaire +1 more source
Det‐extremal cubic bipartite graphs
Journal of Graph Theory, 2003AbstractLet G be a connected k–regular bipartite graph with bipartition V(G) = X ∪ Y and adjacency matrix A. We say G is det‐extremal if per (A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det‐extremal 3‐connected cubic bipartite graphs.
FUNK, Martin +3 more
openaire +2 more sources
Extremal maximal uniquely hamiltonian graphs
Journal of Graph Theory, 1980AbstractLet G be a graph of order n with exactly one Hamiltonian cycle and suppose that G is maximal with respect to this property. We determine the minimum number of edges G can have.
Barefoot, Curtiss A., Entringer, R. C.
openaire +2 more sources
Extremal Problems for Sparse Graphs
2010We survey some of the recent results related to the study of sparse graphs using the nowhere dense - somewhere dense dichotomy. Particularly we extend known results related to property testing, sublinear expanders, Ramsey numbers and FO model checking.
Nesetril, Jaroslav +1 more
openaire +2 more sources