Sciweavers

78 search results - page 1 / 16
» Minimal Universal Bipartite Graphs
Sort
View
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 5 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
JGT
2010
127views more  JGT 2010»
13 years 3 months ago
On the minimum degree of minimal Ramsey graphs
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
Tibor Szabó, Philipp Zumstein, Stefanie Z&u...
COMBINATORICA
2006
70views more  COMBINATORICA 2006»
13 years 5 months ago
Decomposing Berge Graphs Containing No Proper Wheel, Long Prism Or Their Complements
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
Michele Conforti, Gérard Cornuéjols,...
LATIN
2000
Springer
13 years 8 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito
CATS
2008
13 years 6 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono