scientific article
From MaRDI portal
Publication:3932997
zbMath0476.05037MaRDI QIDQ3932997
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (69)
Triangle-free graphs and forbidden subgraphs ⋮ Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case ⋮ Square-free graphs with no induced fork ⋮ Dominating subgraphs in graphs with some forbidden structures ⋮ Proper orientation of cacti ⋮ Induced subgraphs of graphs with large chromatic number. XI. Orientations ⋮ Chordal directed graphs are not \(\chi\)-bounded ⋮ Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs ⋮ Claw-free graphs---a survey ⋮ Induced subgraphs of graphs with large chromatic number. I. Odd holes ⋮ On indicated coloring of lexicographic product of graphs ⋮ Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions ⋮ 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 ⋮ The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices ⋮ 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 ⋮ The Structure of $I_4$-Free and Triangle-Free Binary Matroids ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ Trees in greedy colorings of hypergraphs ⋮ 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 ⋮ Polynomial bounds for chromatic number VII. Disjoint holes ⋮ Caterpillars in Erdős-Hajnal ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ Colouring squares of claw-free graphs ⋮ 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 ⋮ Divisibility and coloring of some \(P_5\)-free graphs ⋮ On the chromatic number of (P5,dart)-free graphs ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs ⋮ Indicated coloring of the Mycielskian of some families of graphs ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ 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 ⋮ 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 ⋮ Coloring graphs without short cycles and long induced paths ⋮ Characterization of forbidden subgraphs for bounded star chromatic number ⋮ 3-colorability and forbidden subgraphs. I: Characterizing pairs ⋮ Colouring Squares of Claw-free Graphs ⋮ Effective on-line coloring of \(P_ 5\)-free graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Induced colorful trees and paths in large chromatic graphs ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Colorful induced subgraphs ⋮ On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs ⋮ 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 ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ Structure and colour in triangle-free graphs ⋮ The structure of claw-free binary matroids ⋮ 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 ⋮ Induced cycles and chromatic number ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Fractional cocoloring of graphs
This page was built for publication:
