Sur le coloriage des graphs
From MaRDI portal
Publication:5847741
DOI10.4064/cm-3-2-161-162zbMath0064.17805WikidataQ56001755 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
Coloring graphs with fixed genus and girth, On graphs with strongly independent color-classes, Coloring-flow duality of embedded graphs, On chromatic number of graphs and set-systems, Colouring clique-hypergraphs of circulant graphs, Visibility graphs of point sets in the plane, Two remarks on retracts of graph products, What must and what need not be contained in a graph of uncountable chromatic number?, Multicoloring and Mycielski construction, Non-cover generalized Mycielski, Kneser, and Schrijver 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, On the existence of two non-neighboring subgraphs in a graph, Combinatorial properties of boundary NLC graph languages, A class of additive multiplicative graph functions, On constructive methods in the theory of colour-critical graphs, On an upper bound of the graph's chromatic number, depending on the graph's degree and density, Clique divergent graphs with unbounded sequence of diameters, Improving heuristics for the frequency assignment problem, Circular chromatic numbers of Mycielski's graphs, 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, Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs, On the triangle vertex Folkman numbers, Coloring the hypergraph of maximal cliques of a graph with no long path, Circular chromatic number and a generalization of the construction of Mycielski., 3-colorability and forbidden subgraphs. I: Characterizing pairs, Fractional dominations and fractional total dominations of graph complements, The subchromatic number of a graph, 4-chromatic graphs with large odd girth, Graph imperfection. I, Circular chromatic number for iterated Mycielski graphs, Connectivity of the Mycielskian of a graph, Colorful subgraphs in Kneser-like graphs, Coloring graphs by iterated local search traversing feasible and infeasible solutions, On classes of minimal circular-imperfect graphs, Embedding a novel objective function in a two-phased local search for robust vertex coloring, Toughness in graphs -- a survey, Several parameters of generalized Mycielskians, On extracting maximum stable sets in perfect graphs using Lovász's theta function, Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner, On strongly circular-perfectness, On minimal 5-chromatic triangle-free graphs
