Results 21 to 30 of about 152,670 (312)
Covering complete partite hypergraphs by monochromatic components [PDF]
, 2016 A well-known special case of a conjecture attributed to Ryser states that k-partite intersecting hypergraphs have transversals of at most k-1 vertices. An equivalent form was formulated by Gy\'arf\'as: if the edges of a complete graph K are colored with ...
Gyárfás, András, Király, Zoltán
core +2 more sources
Complexity of C_k-Coloring in Hereditary Classes of Graphs [PDF]
, 2019 For a graph F, a graph G is F-free if it does not contain an induced subgraph isomorphic to F. For two graphs G and H, an H-coloring of G is a mapping f:V(G) -> V(H) such that for every edge uv in E(G) it holds that f(u)f(v)in E(H).
Chudnovsky, Maria +4 more
core +3 more sources
Maximum Colored Cuts in Edge‐Colored Complete Graphs
Journal of Mathematics, 2022 Max‐Cut problem is one of the classical problems in graph theory and has been widely studied in recent years. Maximum colored cut problem is a more general problem, which is to find a bipartition of a given edge‐colored graph maximizing the number of colors in edges going across the bipartition.
openaire +2 more sources
On the complexity of some quorum colorings problems of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A partition of the vertex set V of a graph G into k color classes with is called a quorum coloring if for every vertex at least half of the vertices in the closed neighborhood of v have the same color as v.
Rafik Sahbi
doaj +1 more source
Operations of Single Valued Neutrosophic Coloring [PDF]
Neutrosophic Sets and Systems, 2020 Smarandache introduced the concept of Neutrosophic which deals with membership, non-membership and indeterminacy values. Wang discussed the Single Valued Neutrosophic sets in 2010.
A. Rohini +4 more
doaj +1 more source
Coloring Complete and Complete Bipartite Graphs from Random Lists
Graphs and Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carl Johan Casselgren, Roland Häggkvist
openalex +4 more sources
Interval edge-coloring: A model of curriculum scheduling
AKCE International Journal of Graphs and Combinatorics, 2020 Considering the appointments that teachers plan to teach some courses for specific classes, the problem is to schedule the curriculum such that the time for each teacher is consecutive.
Zehui Shao +4 more
doaj +1 more source
Uniquely list colorability of the graph Kn^2 + Om
Selecciones Matemáticas, 2020 Given a list L(v) for each vertex v, we say that the graph G is L-colorable if there is a proper vertex coloring of G where each vertex v takes its color from L(v). The graph is uniquely k-list colorable if there is a list assignment L such that jL(v)j =
Le Xuan Hung
doaj +1 more source
On subgraphs without large components [PDF]
Mathematica Bohemica, 2017 We consider, for a positive integer $k$, induced subgraphs in which each component has order at most $k$. Such a subgraph is said to be $k$-divided. We show that finding large induced subgraphs with this property is NP-complete.
Glenn G. Chappell, John Gimbel
doaj +1 more source
Gestalt Theory, 2022 Summary Amodal completion involves the impression of existence and properties of visually occluded parts of objects. One aspect of this phenomenon that has been somewhat neglected is the amodal completion of color, which involves the impression that amodally completed surfaces have a particular color.
openaire +2 more sources