scientific article
From MaRDI portal
Publication:4063176
zbMath0307.05111MaRDI QIDQ4063176
No author found.
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (55)
Triangle-free graphs and forbidden subgraphs ⋮ Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Proper orientation of cacti ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Chordal directed graphs are not \(\chi\)-bounded ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ 2-divisibility of some odd hole free graphs ⋮ Applications of hypergraph coloring to coloring graphs not inducing certain trees ⋮ Graph classes with linear Ramsey numbers ⋮ Applications of edge coloring of multigraphs to vertex coloring of graphs ⋮ Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ A note on chromatic number and induced odd cycles ⋮ Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree ⋮ Extending the Gyárfás-Sumner conjecture ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number. III. Excluding a double star ⋮ Coloring of some crown-free graphs ⋮ On coloring digraphs with forbidden induced subgraphs ⋮ An optimal χ‐bound for (P6, diamond)‐free graphs ⋮ Polynomial bounds for chromatic number VII. Disjoint holes ⋮ Caterpillars in Erdős-Hajnal ⋮ Coloring graphs without induced \(P_5\) or \(K_5-e\) ⋮ Chromatic number and subtrees of graphs ⋮ A note on the Gyárfás-Sumner conjecture ⋮ Graphs of separability at most 2 ⋮ Disjointness graphs of short polygonal chains ⋮ Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs ⋮ Hitting all maximum stable sets in \(P_5\)-free graphs ⋮ A Generalization of $$\chi $$-Binding Functions ⋮ Near optimal colourability on hereditary graph families ⋮ Graphs of large chromatic number ⋮ Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\) ⋮ Heroes in oriented complete multipartite graphs ⋮ Induced subtrees in graphs of large chromatic number ⋮ Polynomial bounds for chromatic number VI. Adding a four-vertex path ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ Characterization of forbidden subgraphs for bounded star chromatic number ⋮ 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. ⋮ 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 ⋮ Induced subgraphs of graphs with large chromatic number. XIII. New brooms ⋮ On induced colourful paths in triangle-free graphs ⋮ Structure and colour in triangle-free graphs ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings ⋮ Large induced trees in \(K_r\)-free graphs ⋮ Pure pairs. II: Excluding all subdivisions of a graph ⋮ $(2P_2,K_4)$-Free Graphs are 4-Colorable ⋮ Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded ⋮ Induced cycles and chromatic number ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes ⋮ Restricted frame graphs and a conjecture of Scott ⋮ Fractional cocoloring of graphs
This page was built for publication:
