Meet- and join-irreducibility of additive hereditary properties of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

some properties of fuzzy hilbert spaces and norm of operators

in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...

15 صفحه اول

Generalized chromatic numbers and additive hereditary properties of graphs

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. Let P and Q be additive hereditary properties of graphs. The generalized chromatic number χQ(P) is defined as follows: χQ(P) = n iff P ⊆ Qn but P 6⊆ Qn−1. We investigate the generalized chromatic numbers of the well-known properties of graphs Ik, Ok, Wk, Sk and Dk.

متن کامل

Generalized edge-chromatic numbers and additive hereditary properties of graphs

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. Let P and Q be hereditary properties of graphs. The generalized edge-chromatic number ρQ(P) is defined as the least integer n such that P ⊆ nQ. We investigate the generalized edge-chromatic numbers of the properties → H, Ik, Ok, W∗ k , Sk and Dk.

متن کامل

The decomposability of additive hereditary properties of graphs

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If P1, . . . ,Pn are properties of graphs, then a (P1, . . . ,Pn)-decomposition of a graph G is a partition E1, . . . , En of E(G) such that G[Ei], the subgraph of G induced by Ei, is in Pi, for i = 1, . . . , n. We define P1⊕· · ·⊕ Pn as the property {G ∈ I : G has a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(01)00323-5