Coloring perfect \((K_ 4\)-e)-free graphs
From MaRDI portal
Publication:1071025
DOI10.1016/0095-8956(87)90048-7zbMath0585.05007OpenAlexW2093266461MaRDI QIDQ1071025
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90048-7
Related Items
Perfect graphs with no \(P_ 5\) and no \(K_ 5\), Finding and counting small induced subgraphs efficiently, Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Even and odd pairs in linegraphs of bipartite graphs, A reduction procedure for coloring perfect \(K_ 4\)-free graphs, On the optimal transversals of the odd cycles, Building counterexamples, Two classes of perfect graphs, Clique-perfectness and balancedness of some graph classes, Colouring diamond-free graphs, Chair-free Berge graphs are perfect, On weakly diamond-free Berge graphs, Some properties of minimal imperfect graphs, An algorithm for coloring some perfect graphs, On the chromatic number of (\(P_6\), diamond)-free graphs, Arboricity, \(h\)-index, and dynamic algorithms, Classes of perfect graphs, Square-free perfect graphs., Finding and counting small induced subgraphs efficiently, 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs., Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, Counterexamples to three conjectures concerning perfect graphs, Addendum to: M. Conforti and M. R. Rao, ``Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Discrete Mathematics 104 (1992) 23--47, The strong perfect graph conjecture holds for diamonded odd cycle-free graphs, Strong cliques in diamond-free graphs, Unnamed Item, Minimax relations for the partial q-colorings of a graph, Partial characterizations of circular-arc graphs, On minimal imperfect graphs without induced \(P_5\), Sequential colorings and perfect graphs, \(P_4\)-domination in minimal imperfect graphs, The strong perfect graph conjecture: 40 years of attempts, and its resolution, On perfectness of sums of graphs, On Tucker vertices of graphs, No odd pairs in minimal imperfect NP\({}_{5}\) graphs., Quasi-star-cutsets and some consequences, Gridline graphs: A review in two dimensions and an extension to higher dimensions
Cites Work
