Publication:4063176
From MaRDI portal
zbMath0307.05111MaRDI QIDQ4063176
No author found.
Publication date: 1975
Related Items
$(2P_2,K_4)$-Free Graphs are 4-Colorable, On induced colourful paths in triangle-free graphs, Restricted frame graphs and a conjecture of Scott, Proper orientation of cacti, Induced subgraphs of graphs with large chromatic number. I. Odd holes, Extending the Gyárfás-Sumner conjecture, Graphs of separability at most 2, Induced colorful trees and paths in large chromatic graphs, Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors, First-fit coloring of bounded tolerance graphs, Large induced trees in \(K_r\)-free graphs, Applications of edge coloring of multigraphs to vertex coloring of graphs, Induced subtrees in graphs of large chromatic number, Induced cycles and chromatic number, 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs., Triangle-free graphs and forbidden subgraphs, Induced subgraphs of graphs with large chromatic number. XI. Orientations, A note on chromatic number and induced odd cycles, Chromatic number and subtrees of graphs, Characterization of forbidden subgraphs for bounded star chromatic number, Applications of hypergraph coloring to coloring graphs not inducing certain trees, Induced subgraphs of graphs with large chromatic number. XIII. New brooms, Structure and colour in triangle-free graphs, Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings, Pure pairs. II: Excluding all subdivisions of a graph, Fractional cocoloring of graphs, Chordal directed graphs are not \(\chi\)-bounded, On the chromatic number of some \(P_5\)-free graphs, Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case, Caterpillars in Erdős-Hajnal, Graph classes with linear Ramsey numbers, Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
