The following pages link to Sur le coloriage des graphs (Q5847741):
Displayed 44 items.
- Two remarks on retracts of graph products (Q686296) (← links)
- What must and what need not be contained in a graph of uncountable chromatic number? (Q794660) (← links)
- Multicoloring and Mycielski construction (Q932681) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- On the existence of two non-neighboring subgraphs in a graph (Q1078191) (← links)
- Combinatorial properties of boundary NLC graph languages (Q1089808) (← links)
- A class of additive multiplicative graph functions (Q1103643) (← links)
- On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density (Q1229732) (← links)
- Clique divergent graphs with unbounded sequence of diameters (Q1292855) (← links)
- Improving heuristics for the frequency assignment problem (Q1296060) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Bounds for the frequency assignment problem (Q1356496) (← links)
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs (Q1356685) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs (Q1392568) (← links)
- On the triangle vertex Folkman numbers (Q1408894) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- Circular chromatic number and a generalization of the construction of Mycielski. (Q1417963) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- Fractional dominations and fractional total dominations of graph complements (Q1613430) (← links)
- The subchromatic number of a graph (Q1823255) (← links)
- 4-chromatic graphs with large odd girth (Q1842185) (← links)
- Graph imperfection. I (Q1850556) (← links)
- Circular chromatic number for iterated Mycielski graphs (Q1877680) (← links)
- Connectivity of the Mycielskian of a graph (Q2427520) (← links)
- Colorful subgraphs in Kneser-like graphs (Q2461775) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Several parameters of generalized Mycielskians (Q2495898) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner (Q2529908) (← links)
- On strongly circular-perfectness (Q3439367) (← links)
- On minimal 5-chromatic triangle-free graphs (Q3856793) (← links)
- Coloring graphs with fixed genus and girth (Q4372592) (← links)
- On graphs with strongly independent color-classes (Q4736765) (← links)
- Coloring-flow duality of embedded graphs (Q5461372) (← links)
- On chromatic number of graphs and set-systems (Q5530478) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
- Visibility graphs of point sets in the plane (Q5920506) (← links)