Results 81 to 90 of about 11,475 (265)

On vertex coloring without monochromatic triangles

, 2017
We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles.
B Courcelle, C Thomassen, DP Dailey, J Fiala, J Mycielski, K Kawarabayashi, M Karpiński, N Alon, P Angelini, P Erdos, P Formanowicz, R Brooks, S Skulrattanakulchai, T Kaiser, Y Shitov   +14 more
core   +1 more source

Fractional colorings of partial $t$-trees with no large clique [PDF]

, 2023
Peter Bradshaw
openalex   +1 more source

Analogues of cliques for oriented coloring

Discussiones Mathematicae Graph Theory, 2004
Considered are subgraphs of oriented graphs in the context of oriented colouring that are analogous to cliques in traditional vertex colouring. Bounds on the sizes of these subgraphs are given for planar, outerplaner and series-parallel graphs. The authors show, among other things, that a planar graph cannot contain an induced subgraph \(D\) with more ...
Klostermeyer, William F., MacGillivray, Gary   +1 more
openaire   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Data Reduction for Graph Coloring Problems

, 2013
This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring
Bart M.P. Jansen, Bodlaender, Bodlaender, Bodlaender, Bodlaender, Bodlaender, Brandstädt, Bruce, Cai, Chor, Dell, Downey, Fellows, Fellows, Fiala, Fomin, Fomin, Fortnow, Garey, Guo, Hoàng, Jansen, Knuth, Kobler, Kratochvíl, Lokshtanov, Marx, Marx, Stefan Kratsch, Tuza, Yap   +30 more
core   +1 more source

Two-colorings with many monochromatic cliques in both colors

Journal of Combinatorial Theory, Series B, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frankl, Péter, Kato, M., Katona, Gyula, Tokushige, N.   +3 more
openaire   +1 more source

A Framework for Subgroup Dynamics Through the System Dynamics Lens: An Integrative Review of the Attribute and the Network Views

Journal of Organizational Behavior, EarlyView.
ABSTRACT Subgroups are dynamic entities evolving constantly in response to changing contexts and time. Although scholars from both the attribute and the network views have acknowledged that subgroups are inherently complex and fluid, research in these traditions has remained bifurcated, with limited efforts to integrate the two perspectives to more ...
Jinhee Moon, Chunghyun Oh, Chou‐Yu Tsai, Semin Park   +3 more
wiley   +1 more source

Further Results on the 3-Consecutive Vertex Coloring Number of Certain Graphs

IEEE Access
A 3-consecutive vertex coloring is an assignment of colors on vertices of a graph G such that for any 3-consecutive vertices $a, b$ and c, the color of b is the same as the color of a or c.
Dona John, Charles Dominic, Jobish Vallikavungal   +2 more
doaj   +1 more source

Clique coloring $B_1$-EPG graphs

, 2017
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are $2$-clique colorable.
Bonomo, Flavia, Mazzoleni, María Pía, Stein, Maya   +2 more
core  

Beck's Conjecture for Power Graphs [PDF]

, 2014
Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988.
Das, Priya, Mukherjee, Himadri
core