Number of edges in degree-magic graphs
نویسندگان
چکیده
منابع مشابه
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
We determine the maximum number of edges that a claw-free graph can have, when its maximum degree and matching number are bounded. This is a famous problem that has been studied on general graphs, and for which there is a tight bound. The graphs achieving this bound contain in most cases an induced copy of K1,3, the claw, which motivates studying the question on claw-free graphs. Note that on g...
متن کاملLight edges in degree-constrained graphs
Let denote the average degree, and Æ denote the minimum degree of a graph. An edge is light if both its endpoints have degree bounded by a constant depending only on and Æ. A graph is degree-constrained if < 2Æ. The primary result of this paper is that every degree-constrained graph has a light edge. Most previous results in this direction have been for embedded graphs. This result is extended ...
متن کاملThe maximum number of edges in 2K2-free graphs of bounded degree
We call a graph 2K2-free if it is connected and does not contain two independent edges as an induced subgraph. The assumption of connectedness in this definition only serves to eliminate isolated vertices. Wagon [6] proved that x(G) ~ w(G)[w(G) + 1]/2 if G is 2Krfree where x(G) and w(G) denote respectively the chromatic number and maximum clique size of G. Further properties of 2K2-free graphs ...
متن کاملTHE MAXIMUM NUMBER OF EDGES IN x*-FREE GRAPHS OF BOUNDED DEGREE
We call a graph 2K,-free if it is connected and does not contain two independent edges as an induced subgraph. The assumption of connectedness in this definition only serves to eliminate isolated vertices. Wagon [6] proved that x(G)co(G)[o(G)+ 1]/2 if G is 2K,-free where x(G) and w(G) denote respectively the chromatic number and maximum clique size of G. Further properties of 2Kz-free graphs ha...
متن کاملMinimum Degree, Factors and Magic Graphs
The main result of this paper is as follows: Let G be a graph and m a positive integer such that (i) |V (G)| ≥ 4m+1, (ii) δ(G) ≥ |V (G)| 2 +1. For any subset {e1, . . . , em+1} of E(G), the graph G − {e1, . . . , em} possesses a 2-factor containing em+1. The above Theorem also yields a Dirac type sufficient condition for a graph to be magic. All graphs considered are assumed to be simple and fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.02.018