Sur le coloriage des graphs

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

Clique-coloring of \(K_{3,3}\)-minor free graphs
Colouring quadrangulations of projective spaces
Two remarks on retracts of graph products
Synchronization problems in automata without non-trivial cycles
Square-free graphs with no induced fork
On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
On word colourings and some perfect graphs
Characterizing and bounding the imperfection ratio for some classes of graphs
Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
Chromatic bounds for some classes of \(2 K_2\)-free graphs
The chromatic Ramsey number of odd wheels
On extracting maximum stable sets in perfect graphs using Lovász's theta function
The induced separation dimension of a graph
Bondage numbers of Mycielski graphs
On colorful edge triples in edge-colored complete graphs
Degree and distance based topological indices of graphs
A Sum of Squares Characterization of Perfect Graphs
Coloring Graphs with Constraints on Connectivity
Homomorphism complexes, reconfiguration, and homotopy for directed graphs
Bounds for the frequency assignment problem
On the existence of two non-neighboring subgraphs in a graph
On some graph classes related to perfect graphs: a survey
Vizing bound for the chromatic number on some graph classes
Amalgams and χ-Boundedness
The fractional chromatic number of Zykov products of graphs
Clique numbers of graphs and irreducible exact \(m\)-covers of the integers
On indicated coloring of graphs
On the f-coloring of multigraphs
Indicated coloring of the Mycielskian of some families of graphs
Topological properties of event structures
On cocolourings and cochromatic numbers of graphs
On circular-perfect graphs: a survey
Constraint and Satisfiability Reasoning for Graph Coloring
A class of additive multiplicative graph functions
Embedding a novel objective function in a two-phased local search for robust vertex coloring
Speeding up branch and bound algorithms for solving the maximum clique problem
Connected greedy coloring of \(H\)-free graphs
Edge-critical subgraphs of Schrijver graphs
Multicoloring and Mycielski construction
Graphs vertex-partitionable into strong cliques
On solving the queen graph coloring problem
4-chromatic graphs with large odd girth
The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
Title not available (Why is that?)
Clique divergent graphs with unbounded sequence of diameters
DOMINATION PARAMETERS IN MYCIELSKI GRAPHS
Stability results for graphs with a critical edge
On minimal 5-chromatic triangle-free graphs
Notes on tree- and path-chromatic number
The smallest hard-to-color graph for the SL algorithm
Critical graphs without triangles: an optimum density construction
On dynamic coloring of certain cycle-related graphs
A note on a conjecture of Wu, Xu and Xu
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
Non-cover generalized Mycielski, Kneser, and Schrijver graphs
Combinatorial properties of boundary NLC graph languages
The circular altitude of a graph
On the triangle vertex Folkman numbers
The Cinderella Game on Holes and Anti-holes
The subchromatic number of a graph
Toughness in graphs -- a survey
Restricted frame graphs and a conjecture of Scott
Total chromatic number of generalized Mycielski graphs
Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
Edge-chromatic numbers of Mycielski graphs
Triangle-free geometric intersection graphs with large chromatic number
The generalized 3-connectivity of the Mycielskian of a graph
Triangle-free intersection graphs of line segments with large chromatic number
Coloring graphs by iterated local search traversing feasible and infeasible solutions
Induced Separation Dimension
A conjecture on critical graphs and connections to the persistence of associated primes
On graphs with strongly independent color-classes
Chromatic Gallai identities operating on Lovász number
Coloring intersection graphs of arc-connected sets in the plane
Coloring graphs with fixed genus and girth
Gromov hyperbolicity in Mycielskian graphs
On atom-bond connectivity index of graphs
Several parameters of generalized Mycielskians
Frozen development in graph coloring
Some colouring problems for Paley graphs
Perfect graphs of arbitrarily large clique-chromatic number
Coloring the hypergraph of maximal cliques of a graph with no long path
3-colorability and forbidden subgraphs. I: Characterizing pairs
On an upper bound of the graph's chromatic number, depending on the graph's degree and density
Circular chromatic numbers of Mycielski's graphs
Graph imperfection. I
Circular chromatic number and a generalization of the construction of Mycielski.
On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
Legal coloring of graphs
Total weight choosability of cone graphs
Randomly colouring graphs (a combinatorial view)
Packing chromatic number versus chromatic and clique number
On classes of minimal circular-imperfect graphs
Coloring-flow duality of embedded graphs
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
Substitution and \(\chi\)-boundedness
Indeterminate strings, prefix arrays \& undirected graphs
On chromatic number of graphs and set-systems
Fractional Turan's theorem and bounds for the chromatic number

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)