scientific article

From MaRDI portal
Publication:3932997

zbMath0476.05037MaRDI QIDQ3932997

David P. Sumner

Publication date: 1981


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Triangle-free graphs and forbidden subgraphsColoring graphs with no even hole \(\geqslant 6\): the triangle-free caseSquare-free graphs with no induced forkDominating subgraphs in graphs with some forbidden structuresProper orientation of cactiInduced subgraphs of graphs with large chromatic number. XI. OrientationsChordal directed graphs are not \(\chi\)-boundedForbidden induced pairs for perfectness and \(\omega\)-colourability of graphsOn the chromatic number of some \(P_5\)-free graphsExhaustive Generation of k-Critical $${\mathcal H}$$ -Free GraphsClaw-free graphs---a surveyInduced subgraphs of graphs with large chromatic number. I. Odd holesOn indicated coloring of lexicographic product of graphsHomogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functionsApplications of hypergraph coloring to coloring graphs not inducing certain treesGraph classes with linear Ramsey numbersApplications of edge coloring of multigraphs to vertex coloring of graphsThe chromatic number of triangle-free and broom-free graphs in terms of the number of verticesDegeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphsA note on chromatic number and induced odd cyclesThe Structure of $I_4$-Free and Triangle-Free Binary MatroidsDecomposing and colouring some locally semicomplete digraphsTrees in greedy colorings of hypergraphsPolynomial bounds for chromatic number. I. Excluding a biclique and an induced treeExtending the Gyárfás-Sumner conjecturePolynomial bounds for chromatic number II: Excluding a star‐forestPolynomial bounds for chromatic number. III. Excluding a double starColoring of some crown-free graphsOn coloring digraphs with forbidden induced subgraphsPolynomial bounds for chromatic number VII. Disjoint holesCaterpillars in Erdős-HajnalOn the chromatic number of \(P_5\)-free graphs with no large intersecting cliquesColouring squares of claw-free graphsColoring graphs without induced \(P_5\) or \(K_5-e\)Chromatic number and subtrees of graphsA note on the Gyárfás-Sumner conjectureDivisibility and coloring of some \(P_5\)-free graphsOn the chromatic number of (P5,dart)-free graphsPolynomial \(\chi\)-binding functions for \(t\)-broom-free graphsIndicated coloring of the Mycielskian of some families of graphsA Ramsey–Turán theory for tilings in graphsGraphs of large chromatic numberProving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\)Heroes in oriented complete multipartite graphsPolynomial bounds for chromatic number VI. Adding a four-vertex pathA tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphsColoring graphs without short cycles and long induced pathsCharacterization of forbidden subgraphs for bounded star chromatic number3-colorability and forbidden subgraphs. I: Characterizing pairsColouring Squares of Claw-free GraphsEffective on-line coloring of \(P_ 5\)-free graphsPolynomial \(\chi \)-binding functions and forbidden induced subgraphs: a surveyInduced colorful trees and paths in large chromatic graphsColoring graphs without fan vertex-minors and graphs without cycle pivot-minorsColorful induced subgraphsOn forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphsFirst-fit coloring of bounded tolerance graphsInduced subgraphs of graphs with large chromatic number. XIII. New broomsOn induced colourful paths in triangle-free graphsExtension of Gyárfás-Sumner conjecture to digraphsStructure and colour in triangle-free graphsThe structure of claw-free binary matroidsInduced subgraphs of graphs with large chromatic number. V. Chandeliers and stringsLarge induced trees in \(K_r\)-free graphsPure pairs. II: Excluding all subdivisions of a graphInduced cycles and chromatic numberFrom \(\chi\)- to \(\chi_p\)-bounded classesTreewidth versus Clique Number. I. Graph Classes with a Forbidden StructureFractional cocoloring of graphs