On a property of the class of n-colorable graphs
From MaRDI portal
Publication:2563166
DOI10.1016/0095-8956(74)90063-XzbMath0269.05103WikidataQ56475007 ScholiaQ56475007MaRDI QIDQ2563166
Publication date: 1974
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, Unnamed Item, Restrictions of graph partition problems. I, A linear-time recognition algorithm for \(P_{4}\)-reducible graphs, On the structure of bull-free perfect graphs, Short-chorded and perfect graphs, Dominating cliques in \(P_ 5\)-free graphs, On a unique tree representation for \(P_ 4\)-extendible graphs, A tree representation for \(P_ 4\)-sparse graphs, Processor optimization for flow graphs, A note on a paper by D. Seinsche, Base polytopes of series-parallel posets: Linear description and optimization, On minimal imperfect graphs without induced \(P_5\), Sequential colorings and perfect graphs, Functions that are read-once on a subset of their inputs, Perfect graphs with no \(P_ 5\) and no \(K_ 5\), Slightly triangulated graphs are perfect, Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs, Efficient parallel recognition algorithms of cographs and distance hereditary graphs, Complexity of list coloring problems with a fixed total number of colors, On semi-\(P_ 4\)-sparse graphs, The setup polyhedron of series-parallel posets, Chair-free Berge graphs are perfect, A fast parallel algorithm to recognize P4-sparse graphs, 3-colorability and forbidden subgraphs. I: Characterizing pairs, Square-free perfect graphs., Triangle-free graphs and forbidden subgraphs, A simple linear time algorithm for cograph recognition, The allocation problem in hardware design, Transfer flow graphs, Bichromatic \(P_{4}\)-composition schemes for perfect orderability, Recognizing bull-free perfect graphs, Scheduling of conditional executed jobs on unrelated processors, An optimal path cover algorithm for cographs, On the \(P_4\)-components of graphs, On the vertex packing problem, Minimal colorings for properly colored subgraphs, On the \(b\)-dominating coloring of graphs, On the relationship between NLC-width and linear NLC-width
Cites Work
- Unnamed Item
- [https://portal.mardi4nfdi.de/wiki/Publication:5675574 Unverschr�nkte Graphen und strategische Spiele in kombinatorischer Form]
