Sur le coloriage des graphs

Cited in

(only showing first 100 items - show all)

Amalgams and \(\chi\)-boundedness
A Sum of Squares Characterization of Perfect Graphs
The chromatic Ramsey number of odd wheels
On some graph classes related to perfect graphs: a survey
Coloring Graphs with Constraints on Connectivity
On word colourings and some perfect graphs
Speeding up branch and bound algorithms for solving the maximum clique problem
Bounds for the frequency assignment problem
Square-free graphs with no induced fork
Connected greedy coloring of \(H\)-free graphs
Edge-critical subgraphs of Schrijver graphs
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
On dynamic coloring of certain cycle-related graphs
Colouring quadrangulations of projective spaces
On minimal 5-chromatic triangle-free graphs
Multicoloring and Mycielski construction
Indicated coloring of the Mycielskian of some families of graphs
Chromatic bounds for some classes of \(2 K_2\)-free graphs
Critical graphs without triangles: an optimum density construction
Topological properties of event structures
Notes on tree- and path-chromatic number
Clique-coloring of \(K_{3,3}\)-minor free graphs
On solving the queen graph coloring problem
Embedding a novel objective function in a two-phased local search for robust vertex coloring
Characterizing and bounding the imperfection ratio for some classes of graphs
On cocolourings and cochromatic numbers of graphs
Graphs vertex-partitionable into strong cliques
The fractional chromatic number of Zykov products of graphs
On extracting maximum stable sets in perfect graphs using Lovász's theta function
The Cinderella Game on Holes and Anti-holes
The smallest hard-to-color graph for the SL algorithm
A note on a conjecture of Wu, Xu and Xu
Non-cover generalized Mycielski, Kneser, and Schrijver graphs
Combinatorial properties of boundary NLC graph languages
Two remarks on retracts of graph products
On indicated coloring of graphs
4-chromatic graphs with large odd girth
Clique numbers of graphs and irreducible exact \(m\)-covers of the integers
The induced separation dimension of a graph
Bondage numbers of Mycielski graphs
Domination parameters in Mycielski graphs
A class of additive multiplicative graph functions
On the f-coloring of multigraphs
On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
Clique divergent graphs with unbounded sequence of diameters
On colorful edge triples in edge-colored complete graphs
The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
Homomorphism complexes, reconfiguration, and homotopy for directed graphs
Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
Vizing bound for the chromatic number on some graph classes
Constraint and satisfiability reasoning for graph coloring
The circular altitude of a graph
On the existence of two non-neighboring subgraphs in a graph
Dominator coloring of Mycielskian graphs
On the triangle vertex Folkman numbers
Degree and distance based topological indices of graphs
Stability results for graphs with a critical edge
On circular-perfect graphs: a survey
Colouring clique-hypergraphs of circulant graphs
Colouring clique-hypergraphs of circulant graphs
Circular chromatic number for iterated Mycielski graphs
Coloring graphs by iterated local search traversing feasible and infeasible solutions
On graphs with strongly independent color-classes
Indeterminate strings, prefix arrays \& undirected graphs
Decomposing clique search problems into smaller instances based on node and edge colorings
Coloring the hypergraph of maximal cliques of a graph with no long path
Infra-chromatic bound for exact maximum clique search
Randomly colouring graphs (a combinatorial view)
3-colorability and forbidden subgraphs. I: Characterizing pairs
The subchromatic number of a graph
What must and what need not be contained in a graph of uncountable chromatic number?
scientific article; zbMATH DE number 68344 (Why is no real title available?)
On chromatic number of graphs and set-systems
Some colouring problems for Paley graphs
Induced separation dimension
The domination game played on diameter 2 graphs
On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
Toughness in graphs -- a survey
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
Graph imperfection. I
Packing chromatic number versus chromatic and clique number
Improving heuristics for the frequency assignment problem
ATP and presentation service for Mizar formalizations
Gromov hyperbolicity in Mycielskian graphs
Total chromatic number of generalized Mycielski graphs
Circular coloring and Mycielski construction
Coloring chip configurations on graphs and digraphs
Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
Connectivity of the generalised Mycielskian of digraphs
On classes of minimal circular-imperfect graphs
Visibility graphs of point sets in the plane
Edge-chromatic numbers of Mycielski graphs
Circular chromatic number and a generalization of the construction of Mycielski.
Perfect graphs of arbitrarily large clique-chromatic number
On constructive methods in the theory of colour-critical graphs
Mycielski type constructions for hypergraphs associated with fractional colorings
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
Triangle-free geometric intersection graphs with large chromatic number
Fractional dominations and fractional total dominations of graph complements
Safe lower bounds for graph coloring

This page was built for publication: Sur le coloriage des graphs

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