Sur le coloriage des graphs
From MaRDI portal
Publication:5847741
DOI10.4064/cm-3-2-161-162zbMath0064.17805OpenAlexW2126517143WikidataQ56001755 ScholiaQ56001755MaRDI QIDQ5847741
Publication date: 1955
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/210000
Related Items
Fractional dominations and fractional total dominations of graph complements, On the existence of two non-neighboring subgraphs in a graph, Circular chromatic number for iterated Mycielski graphs, Clique-coloring of \(K_{3,3}\)-minor free graphs, On the Nash number and the diminishing Grundy number of a graph, Square-free graphs with no induced fork, Total weight choosability of cone graphs, Combinatorial properties of boundary NLC graph languages, Relating the total domination number and the annihilation number for quasi-trees and some composite graphs, Reinforcement learning based tabu search for the minimum load coloring problem, Fractional Turan's theorem and bounds for the chromatic number, Bounds for the frequency assignment problem, On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs, The smallest hard-to-color graph for the SL algorithm, Reducing graph coloring to clique search, Reformulated reciprocal degree distance of transformation graph, A class of additive multiplicative graph functions, Packing chromatic number versus chromatic and clique number, Infra-chromatic bound for exact maximum clique search, Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\), Connectivity of the generalised Mycielskian of digraphs, On constructive methods in the theory of colour-critical graphs, Stability results for graphs with a critical edge, Triangle-free geometric intersection graphs with large chromatic number, A note on chromatic number and induced odd cycles, Vertex coloring of a graph for memory constrained scenarios, On some graph classes related to perfect graphs: a survey, Total chromatic number of generalized Mycielski graphs, Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs, The fractional chromatic number of Zykov products of graphs, Triangle-free intersection graphs of line segments with large chromatic number, Edge-chromatic numbers of Mycielski graphs, Eternal domination on prisms of graphs, Perfect graphs of arbitrarily large clique-chromatic number, Chromatic number and subtrees of graphs, Graph classes generated by Mycielskians, ATP and presentation service for Mizar formalizations, On the triangle vertex Folkman numbers, Maximum-weight stable sets and safe lower bounds for graph coloring, On colouring point visibility graphs, New construction of graphs with high chromatic number and small clique number, Coloring the hypergraph of maximal cliques of a graph with no long path, Graphs vertex-partitionable into strong cliques, Circular chromatic number and a generalization of the construction of Mycielski., Inverse sum indeg index of graphs, 3-colorability and forbidden subgraphs. I: Characterizing pairs, Randomly colouring graphs (a combinatorial view), Substitution and \(\chi\)-boundedness, Coloring intersection graphs of arc-connected sets in the plane, On circular-perfect graphs: a survey, Multicoloring and Mycielski construction, Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey, Non-cover generalized Mycielski, Kneser, and Schrijver graphs, Indeterminate strings, prefix arrays \& undirected graphs, On bounding the difference of the maximum degree and the clique number, Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\), Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\), Decomposing clique search problems into smaller instances based on node and edge colorings, Clique coloring \(B_1\)-EPG graphs, On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs, Two remarks on retracts of graph products, Speeding up branch and bound algorithms for solving the maximum clique problem, A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth, Mycielski type constructions for hypergraphs associated with fractional colorings, Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors, On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number, Circular coloring and Mycielski construction, The generalized 3-connectivity of the Mycielskian of a graph, Nordhaus-Gaddum and other bounds for the chromatic edge-stability number, The hub number, girth and Mycielski graphs, A Nice labelling for tree-like event structures of degree 3, A conjecture on critical graphs and connections to the persistence of associated primes, The chromatic gap and its extremes, On an upper bound of the graph's chromatic number, depending on the graph's degree and density, Chromatic bounds for some classes of \(2 K_2\)-free graphs, The induced separation dimension of a graph, On topological indices of graph transformation, Bondage numbers of Mycielski graphs, The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\), Constructions for normal graphs and some consequences, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Characterizing and bounding the imperfection ratio for some classes of graphs, Notes on tree- and path-chromatic number, Clique numbers of graphs and irreducible exact \(m\)-covers of the integers, The subchromatic number of a graph, On sum coloring and sum multi-coloring for restricted families of graphs, Symmetry parameters for Mycielskian graphs, Connected greedy coloring of \(H\)-free graphs, Edge-critical subgraphs of Schrijver graphs, Clique divergent graphs with unbounded sequence of diameters, Partitioning graphs into complete and empty graphs, Improving heuristics for the frequency assignment problem, 4-chromatic graphs with large odd girth, Circular chromatic numbers of Mycielski's graphs, What must and what need not be contained in a graph of uncountable chromatic number?, Graph imperfection. I, A note on a conjecture of Wu, Xu and Xu, Restricted frame graphs and a conjecture of Scott, The domination game played on diameter 2 graphs, \(b\)-coloring of the Mycielskian of some classes of graphs, Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs, Indicated coloring of the Mycielskian of some families of graphs, Coloring (\(P_5\), kite)-free graphs with small cliques, Coloring triangle-free L-graphs with \(O (\log \log n)\) colors, Graphs of large chromatic number, Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of \(P_4\), Integrity of graph operations, Comparing Imperfection Ratio and Imperfection Index for Graph Classes, DOMINATION PARAMETERS IN MYCIELSKI GRAPHS, Edge coloring of graphs, uses, limitation, complexity, Vizing bound for the chromatic number on some graph classes, Induced Separation Dimension, Independence number and packing coloring of generalized Mycielski graphs, On colorful edge triples in edge-colored complete graphs, Questions on color-critical subgraphs, Equitable clique-coloring in claw-free graphs with maximum degree at most 4, Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs, Unnamed Item, Degree and distance based topological indices of graphs, More Results on Clique-chromatic Numbers of Graphs with No Long Path, On the chromatic number of (\(P_6\), diamond)-free graphs, Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs, Power domination in Mycielskian of spiders, On ordinary and weighted Harary indices of Mycielski graphs, THE CHROMATIC NUMBER OF -FREE GRAPHS, Unnamed Item, The exponential growth of the packing chromatic number of iterated Mycielskians, On multichromatic numbers of widely colorable graphs, A Sum of Squares Characterization of Perfect Graphs, Bounds for the chromatic number of some \(pK_2\)-free graphs, Amalgams and χ-Boundedness, Coloring of a superclass of \(2K_2\)-free graphs, Graph Information Ratio, Total colorings-a survey, Computing closeness for some graphs, Connectivity of the Mycielskian of a graph, HUB PARAMETERS AND MYCIELSKIAN OF A GRAPH, Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable, Homomorphism complexes, reconfiguration, and homotopy for directed graphs, Critical graphs without triangles: an optimum density construction, Improvements to MCS algorithm for the maximum clique problem, Unnamed Item, Constraint and Satisfiability Reasoning for Graph Coloring, Symmetry breaking in planar and maximal outerplanar graphs, Chromatic Gallai identities operating on Lovász number, Unnamed Item, Colorful subgraphs in Kneser-like graphs, Coloring graphs with fixed genus and girth, Safe Lower Bounds for Graph Coloring, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Distinguishing Generalized Mycielskian Graphs, On classes of minimal circular-imperfect graphs, Embedding a novel objective function in a two-phased local search for robust vertex coloring, The identifying code number and Mycielski's construction of graphs, Toughness in graphs -- a survey, On minimal 5-chromatic triangle-free graphs, Several parameters of generalized Mycielskians, Solving CSPs with Naming Games, Burling graphs, chromatic number, and orthogonal tree-decompositions, On extracting maximum stable sets in perfect graphs using Lovász's theta function, INFINITE COMBINATORICS PLAIN AND SIMPLE, Neighbor-locating colorings in graphs, On directed local chromatic number, shift graphs, and Borsuk-like graphs, Two cases of polynomial-time solvability for the coloring problem, Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable, Computational and structural aspects of the geodetic and the hull numbers of shadow graphs, Computational and structural aspects of the geodetic and the hull numbers of shadow graphs, Coloring-flow duality of embedded graphs, Colouring clique-hypergraphs of circulant graphs, Degree Distance Index of the Mycielskian and its Complement, Topological Properties of Event Structures, Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian, Hypercube related polytopes, On common neighborhood graphs II, Synchronization problems in automata without non-trivial cycles, Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner, On dynamic coloring of certain cycle-related graphs, Inverse sum indeg coindex of graphs, Unnamed Item, A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, The circular altitude of a graph, Visibility graphs of point sets in the plane, On fractional cut covers, Colouring clique-hypergraphs of circulant graphs, OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS, Bounds for the boxicity of Mycielski graphs, The Cinderella Game on Holes and Anti-holes, On atom-bond connectivity index of graphs, Unnamed Item, The chromatic Ramsey number of odd wheels, Estimating clique size by coloring the nodes of auxiliary graphs, On graphs with strongly independent color-classes, Generalised Mycielski graphs and the Borsuk-Ulam theorem, Burling graphs, chromatic number, and orthogonal tree-decompositions, Gromov hyperbolicity in Mycielskian graphs, Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph, Graphs with coloring redundant edges, Ramsey sequences of graphs, The chromatic discrepancy of graphs, On strict strong coloring of graphs, New directions in Ramsey theory, The Mycielskian of a Graph, On strongly circular-perfectness, Colouring quadrangulations of projective spaces, On chromatic number of graphs and set-systems
