On a property of the class of n-colorable graphs

Cites work

scientific article; zbMATH DE number 3346357 (Why is no real title available?)
Unverschr�nkte Graphen und strategische Spiele in kombinatorischer Form

Cited in

(only showing first 100 items - show all)

Paired-domination in \(P_{5}\)-free graphs
Complete description of forbidden subgraphs in the structural domination problem
Vertex- and edge-minimal and locally minimal graphs
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Generalized complementation
Bull-free Berge graphs are perfect
Murky graphs
Locally perfect graphs
Wings and perfect graphs
Some perfect coloring properties of graphs
Complement reducible graphs
Short-chorded and perfect graphs
Dominating cliques in \(P_ 5\)-free graphs
On a unique tree representation for \(P_ 4\)-extendible graphs
A tree representation for \(P_ 4\)-sparse graphs
Processor optimization for flow graphs
A note on a paper by D. Seinsche
Base polytopes of series-parallel posets: Linear description and optimization
On minimal imperfect graphs without induced P₅
Sequential colorings and perfect graphs
Functions that are read-once on a subset of their inputs
Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
Slightly triangulated graphs are perfect
Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Complexity of list coloring problems with a fixed total number of colors
On semi-\(P_ 4\)-sparse graphs
The setup polyhedron of series-parallel posets
Chair-free Berge graphs are perfect
A fast parallel algorithm to recognize P4-sparse graphs
3-colorability and forbidden subgraphs. I: Characterizing pairs
Square-free perfect graphs.
Triangle-free graphs and forbidden subgraphs
Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
Colouring of (P₃ P₂)-free graphs
Star coloring of certain graph classes
Coupon coloring of cographs
A simple linear time algorithm for cograph recognition
Chromatic bounds for some classes of 2 K₂-free graphs
The allocation problem in hardware design
Transfer flow graphs
Bichromatic \(P_{4}\)-composition schemes for perfect orderability
Recognizing bull-free perfect graphs
Scheduling of conditional executed jobs on unrelated processors
An optimal path cover algorithm for cographs
On the \(P_4\)-components of graphs
Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
Algorithms for maximum internal spanning tree problem for some graph classes
Generalizing cographs to 2-cographs
Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
Characterizing forbidden pairs for relative length of longest paths and cycles
Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
Forbidden triples generating a finite set of graphs with minimum degree three
From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
Neighborhood covering and independence on P₄-tidy graphs and tree-cographs
Distance eigenvalues of a cograph and their multiplicities
Graphs with few trivial characteristic ideals
On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
The Erdős-Hajnal conjecture for rainbow triangles
Faster algorithms for cograph edge modification problems
Cographs: eigenvalues and Dilworth number
Colouring square-free graphs without long induced paths
On the vertex packing problem
On \(r\)-hued colorings of graphs without short induced paths
Classes of perfect graphs
Lines in hypergraphs
Computing square roots of trivially perfect and threshold graphs
Minimal volume product near Hanner polytopes
Competitive graph searches
Skew partitions in perfect graphs
Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
Forbidden pairs and the existence of a dominating cycle
Minimal colorings for properly colored subgraphs
On the \(b\)-dominating coloring of graphs
On the relationship between NLC-width and linear NLC-width
Vizing bound for the chromatic number on some graph classes
Two-colourings that decompose perfect graphs
The signature of chordal graphs and cographs
Complete edge-colored permutation graphs
The trace monoids in the queue monoid and in the direct product of two free monoids
The Erdős-Hajnal conjecture. A survey
Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
A characterization of b-perfect graphs
The A₄-structure of a graph
Clique-perfectness and balancedness of some graph classes
Colouring square-free graphs without long induced paths
Dominator and total dominator colorings in graphs
On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph
Solving the \textsc{induced subgraph} problem in the randomized multiparty simultaneous messages model
On a Class of P ₅ -Free Graphs
P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
A New Class of Brittle Graphs
A New Characterization of P 6-Free Graphs
Partial characterizations of circular-arc graphs
Forbidden subgraphs and the existence of a spanning tree without small degree stems
Excluding pairs of graphs
The price of connectivity for dominating set: upper bounds and complexity
On the spectrum of threshold graphs
The inclusion structure of partially lossy queue monoids and their trace submonoids

This page was built for publication: On a property of the class of n-colorable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563166)