We study the Max Partial $H$-Coloring problem: given a graph $G$, find largest induced subgraph of $G$ that admits homomorphism into $H$, where $H$ is fixed pattern without loops. Note when complete on $k$ vertices, problem reduces to finding $k$-colorable subgraph, which for $k=2$ equivalent (by complementation) Odd Cycle Transversal. prove every loops, can be solved in $\{P_5,F\}$-free graphs...

Abstract In the present paper, the interval-valued pP, P_ qq-fuzzy LI-ideal theory in lattice implication algebras is further studied. Some new properties of interval-valued pP, P_ qq-fuzzy LI-ideals are given. Representation theorem of interval-valued pP, P_ qq-fuzzy LI-ideal which is generated by an interval-valued fuzzy set is established. It is proved that the set consisting of all interval...

We focus on the Ferrers property of fuzzy preference relations. We study the connection between the Ferrers property and fuzzy interval orders. A crisp total interval order is characterized by the Ferrers property of its strict preference relation. Also, a crisp preference structure is a total interval order if and only if its large preference relation satisfies the Ferrers property. For fuzzy ...

In this paper we deal with the problem of the relationship between the equipotency defined a s a consequence of a given definition of scalar cardinality of a fuzzy set and the existence of a bijection between fuzzy sets, which also depends on the definition of fuzzy function or fuzzy mapping between fuzzy sets. We investigate the main definitions and we introduce an intermediate one that is a n...

Many combinatorial problems are NP-complete for general graphs, but are not NP-complete for partial k-trees (graphs of treewidth bounded by a constant k) and can be efficiently solved in polynomial time or mostly in linear time for partial k-trees. On the other hand, very few problems are known to be NP-complete for partial k-trees with bounded k. These include the subgraph isomorphism problem ...