scientific article; zbMATH DE number 3480625
From MaRDI portal
Publication:4063176
zbMATH Open0307.05111MaRDI QIDQ4063176FDOQ4063176
Authors:
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (66)
- Restricted frame graphs and a conjecture of Scott
- From \(\chi\)- to \(\chi_p\)-bounded classes
- Pure pairs. II: Excluding all subdivisions of a graph
- Induced subgraphs of graphs with large chromatic number. I. Odd holes
- On the chromatic number of some \(P_5\)-free graphs
- First-fit coloring of bounded tolerance graphs
- Disjointness graphs of short polygonal chains
- Polynomial bounds for chromatic number. V: Excluding a tree of radius two and a complete multipartite graph
- Fractional cocoloring of graphs
- Graphs of separability at most 2
- Induced cycles and chromatic number
- Extending the Gyárfás-Sumner conjecture
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- Characterization of forbidden subgraphs for bounded star chromatic number
- \((2P_2,K_4)\)-free graphs are 4-colorable
- Induced subgraphs of graphs with large chromatic number. XI. Orientations
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Proper orientation of cacti
- Caterpillars in Erdős-Hajnal
- Large induced trees in \(K_r\)-free graphs
- Triangle-free graphs and forbidden subgraphs
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
- Polynomial bounds for chromatic number II: Excluding a star‐forest
- Polynomial bounds for chromatic number. III. Excluding a double star
- 2-divisibility of some odd hole free graphs
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Hitting all maximum stable sets in \(P_5\)-free graphs
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs
- A Generalization of $$\chi $$-Binding Functions
- Polynomial bounds for chromatic number VII. Disjoint holes
- Coloring of some crown-free graphs
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- A note on chromatic number and induced odd cycles
- Coloring graphs without induced \(P_5\) or \(K_5-e\)
- Induced subtrees in graphs of large chromatic number
- On coloring digraphs with forbidden induced subgraphs
- Induced colorful trees and paths in large chromatic graphs
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
- Graph classes with linear Ramsey numbers
- Induced subgraphs of graphs with large chromatic number. XIII. New brooms
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
- 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
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree
- Chromatic number and subtrees of graphs
- A note on the Gyárfás-Sumner conjecture
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
- Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded
- Structure and colour in triangle-free graphs
- Chordal directed graphs are not \(\chi\)-bounded
- Perfect divisibility and coloring of some fork-free graphs
- Graphs with girth 9 and without longer odd holes are 3-colourable
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
- Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- 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
- The chromatic number of (\(P_5\), HVN)-free graphs
- Polynomial bounds for chromatic number. VIII: Excluding a path and a complete multipartite graph
- Variants of the Gyárfás-Sumner conjecture: oriented trees and rainbow paths
- On the chromatic number of a family of odd hole free graphs
- Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable
- \((\overrightarrow{P_6}\), triangle)-free digraphs have bounded dichromatic number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4063176)
