scientific article; zbMATH DE number 3611388
From MaRDI portal
Publication:4175304
zbMath0394.05020MaRDI QIDQ4175304
H. Joseph Straight, Linda Lesniak
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Partitioning permutations into monotone subsequences, Uniquely cocolourable graphs, Critical 3-cochromatic graphs, Chromatic number versus chromatic number in graphs with bounded clique number, A lower bound on cochromatic number for line graphs of a kind of graphs, A Brooks‐Type Theorem for the Bichromatic Number, Partitioning permutations into increasing and decreasing subsequences, Induced-path partition on graphs with special blocks, Some topics in cochromatic theory, The cochromatic index of a graph, Drawing graphs using a small number of obstacles, Subcolorings and the subchromatic number of a graph, Some defective parameters in graphs, Fixed-parameter algorithms for the cocoloring problem, Partitioning extended \(P_4\)-laden graphs into cliques and stable sets, \((k,l)\)-colourings and Ferrers diagram representations of cographs, On the complexity of generalized chromatic polynomials, Advances on defective parameters in graphs, A note on the bichromatic numbers of graphs, Generalised online colouring problems in overlap graphs, Cycles in digraphs– a survey, The subchromatic number of a graph, Partitioning graphs into complete and empty graphs, A sequential coloring algorithm for finite sets, Some of My Favorite Coloring Problems for Graphs and Digraphs, Approximating minimum cocolorings., On cocolourings and cochromatic numbers of graphs, Fractional cocoloring of graphs, \((p,k)\)-coloring problems in line graphs
