A sufficient condition for a graph to be weakly k-linked
نویسندگان
چکیده
منابع مشابه
On Sufficient Degree Conditions for a Graph to be k-linked
1Graduate School of Information Sciences (GSIS), Tohoku University, Aramaki aza Aoba 09, Aoba-ku Sendai, Miyagi, 980-8579, Japan (e-mail: k [email protected]) 2Department of Mathematics, University of Illinois, Urbana, IL 61801, USA and Institute of Mathematics, Novosibirsk 630090, Russia (e-mail: [email protected]) 3Department of Mathematics, University of Illinois, Urbana, IL 6...
متن کاملA necessary and sufficient eigenvector condition for a connected graph to be bipartite
We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.
متن کاملA Necessary and Sufficient Condition for Graph Matching to be equivalent to Clique Search
This paper formulates a necessary and sufficient condition for a generic graph matching problem to be equivalent to the maximum vertex and edge weight clique problem in a derived association graph. The consequences of this results are threefold: first, the condition is general enough to cover a broad range of practical graph matching problems; second, a proof to establish equivalence between gr...
متن کاملA New Sufficient Condition for a Digraph to Be Hamiltonian
In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ? (x)+d + (y)g n ?1 for all pairs of ve...
متن کاملA sufficient condition for planar graphs to be 3-colorable
Planar graphs without 3-cycles at distance less than 4 and without 5-cycles are proved to be 3-colorable. We conjecture that, moreover, each plane graph with neither 5-cycles nor intersecting 3-cycles is 3-colorable. In this conjecture, none of the two assumptions can be dropped because there exist planar 4-chromatic graphs without 5-cycles, as well as planar 4chromatic graphs without intersect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1984
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90015-7