On a property of the class of n-colorable graphs

Cites Work

Title not available (Why is that?)
Unverschr�nkte Graphen und strategische Spiele in kombinatorischer Form

Cited In (only showing first 100 items - show all)

A New Characterization of P 6-Free Graphs
The allocation problem in hardware design
Two-colourings that decompose perfect graphs
Excluding pairs of graphs
Dichotomizing $k$-vertex-critical $H$-free graphs for $H$ of order four
On the complexity of role colouring planar graphs, trees and cographs
Functions that are read-once on a subset of their inputs
On the $b$-dominating coloring of graphs
Processor optimization for flow graphs
On the spectrum of threshold graphs
The Erdős-Hajnal conjecture for rainbow triangles
PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
Forbidden pairs and the existence of a dominating cycle
Geometry and Combinatorics via Right-Angled Artin Groups
Primitivity is hereditary for 2-structures
A characterization of claw-free $b$-perfect graphs
On the vertex packing problem
Title not available (Why is that?)
Minimal colorings for properly colored subgraphs
Bull-free Berge graphs are perfect
A bipartite analogue of Dilworth's theorem
3-colorability and forbidden subgraphs. I: Characterizing pairs
Colouring of $(P_3 \cup P_2)$-free graphs
Some perfect coloring properties of graphs
Complement reducible graphs
Bounding $\chi $ in terms of $\omega $ and $\varDelta $ for some classes of graphs
Chromatic bounds for some classes of $2 K_2$-free graphs
Counting Small Induced Subgraphs Satisfying Monotone Properties
Completely separable graphs
Characterizing forbidden pairs for relative length of longest paths and cycles
The Erdős-Hajnal conjecture. A survey
Graph theory (algorithmic, algebraic, and metric problems)
The price of connectivity for dominating set: upper bounds and complexity
Complete description of forbidden subgraphs in the structural domination problem
Dominating cliques in $P_ 5$-free graphs
Mixed graphs with smallest eigenvalue greater than $- \sqrt{3}$
Cographs: eigenvalues and Dilworth number
Colouring square-free graphs without long induced paths
An optimal path cover algorithm for cographs
Triangle-free graphs and forbidden subgraphs
Characterization of $P_{6}$-free graphs
A tree representation for $P_ 4$-sparse graphs
On a unique tree representation for $P_ 4$-extendible graphs
Vizing bound for the chromatic number on some graph classes
Star coloring of certain graph classes
Competitive graph searches
Paired-domination in $P_{5}$-free graphs
Vertex- and edge-minimal and locally minimal graphs
Efficient parallel recognition algorithms of cographs and distance hereditary graphs
Cycle-maximal triangle-free graphs
Computing square roots of trivially perfect and threshold graphs
Partial characterizations of circle graphs
Classes of perfect graphs
P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
Recognizing bull-free perfect graphs
On the relationship between NLC-width and linear NLC-width
The strong perfect graph conjecture: 40 years of attempts, and its resolution
Dominator and Total Dominator Colorings in Graphs
A note on a paper by D. Seinsche
Partial characterizations of circular-arc graphs
Square-free perfect graphs.
The inclusion structure of partially lossy queue monoids and their trace submonoids
On semi-$P_ 4$-sparse graphs
On the structure of bull-free perfect graphs
Not complementary connected and not CIS $d$-graphs form weakly monotone families
Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
A characterization of $b$-perfect graphs
The $A_4$-structure of a graph
Restrictions of graph partition problems. I
A simple linear time algorithm for cograph recognition
Partitions of graphs into cographs
Dominator colorings in some classes of graphs
A linear-time recognition algorithm for $P_{4}$-reducible graphs
On the $P_4$-components of graphs
Complexity and parameterized algorithms for cograph editing
Graphs defined on groups
Partial characterization of graphs having a single large Laplacian eigenvalue
The graphs with exactly two distance eigenvalues different from $-1$ and $-3$
Lines in hypergraphs
Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs
A New Class of Brittle Graphs
Forbidden subgraphs and the existence of a spanning tree without small degree stems
A fast parallel algorithm to recognize P4-sparse graphs
On the Nordhaus-Gaddum Problem for the k-Defective Chromatic Number of a Graph
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model
On 3‐graphs with no four vertices spanning exactly two edges
Towards the Erdős-Hajnal conjecture for $P_5$-free graphs
Spectral properties of cographs andP₅-free graphs
Complexity of total dominator coloring in graphs
A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
Murky graphs
Cograph editing: Merging modules is equivalent to editing P_4s
Generalizing cographs to 2-cographs
The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
Infinite versus finite graph domination
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids
The setup polyhedron of series-parallel posets
Locally perfect graphs
Wings and perfect graphs

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)