'3in1' enhanced: Three squares ways to "3in 1" GRAPHS
نویسنده
چکیده
منابع مشابه
Proof of the List Edge Coloring Conjecture for Complete Graphs of Prime Degree
We prove that the list-chromatic index and paintability index of Kp+1 is p, for all odd primes p. This implies that the List Edge Coloring Conjecture holds for complete graphs with less than 10 vertices. It also shows that there exist arbitrarily big complete graphs for which the conjecture holds, even among the complete graphs of class 1. Our proof combines the Quantitative Combinatorial Nulls...
متن کاملCrystal Structure, Chemical Bonding and Magnetism Studies for Three Quinary Polar Intermetallic Compounds in the (Eu1−xCax)9In8(Ge1−ySny)8 (x = 0.66, y = 0.03) and the (Eu1−xCax)3In(Ge3−ySn1+y) (x = 0.66, 0.68; y = 0.13, 0.27) Phases
Three quinary polar intermetallic compounds in the (Eu(1-x)Ca(x))9In8(Ge(1-y)Sn(y))8 (x = 0.66, y = 0.03) and the (Eu(1-x)Ca(x))3In(Ge(3-y)Sn(1+y)) (x = 0.66, 0.68; y = 0.13, 0.27) phases have been synthesized using the molten In-metal flux method, and the crystal structures are characterized by powder and single-crystal X-ray diffractions. Two orthorhombic structural types can be viewed as an ...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملOn median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djoković-Winkler’s relation Θ and let h be the number of Q3’s in G. Then we prove that 2n −m − k + h = 2. We also characterize median grid graphs in several different ways, for instance, they are the grid graphs with m− n + 1 squares. To obtain these results we introduce the notion of square...
متن کاملBar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
A graph is called a strong ( resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a -thick vertical line connecting them that intersects at most one other bar. We explore the relation among weak (resp. strong) bar 1-visibility graphs and other nearly pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 27 شماره
صفحات -
تاریخ انتشار 2007