Pages that link to "Item:Q5539654"
From MaRDI portal
The following pages link to Nombre chromatique et plus longs chemins d'un graphe (Q5539654):
Displaying 50 items.
- Proof of Berge's path partition conjecture for \(k \geq \lambda - 3\) (Q298972) (← links)
- Graph saturation games (Q324842) (← links)
- A Ramsey type result for oriented trees (Q338566) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- The size Ramsey number of a directed path (Q414648) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Coloring digraphs with forbidden cycles (Q490994) (← links)
- On Linial's conjecture for spine digraphs (Q512554) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← links)
- On the strong path partition conjecture of Berge (Q686176) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- Simple proofs of results on paths representing all colors in proper vertex-colorings (Q879947) (← links)
- Paths with two blocks in \(n\)-chromatic digraphs (Q885298) (← links)
- On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem (Q943796) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Using stable sets to bound the chromatic number (Q1014408) (← links)
- Paths, cycles and circular colorings in digraphs (Q1019171) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- Separating pairs of points of standard boxes (Q1075327) (← links)
- On k-optimum dipath partitions and partial k-colourings of acyclic digraphs (Q1082350) (← links)
- Monochromatic directed walks in arc-colored directed graphs (Q1088681) (← links)
- Local \(k\)-colorings of graphs and hypergraphs (Q1095156) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- k-optimal partitions of a directed graph (Q1172068) (← links)
- Gallai's problem on Dirac's construction (Q1197042) (← links)
- On the Berge's strong path partition conjecture (Q1210577) (← links)
- Acyclic orientations of a graph and the chromatic and independence numbers (Q1227749) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Mixed graph colorings (Q1360876) (← links)
- Acyclic subgraphs with high chromatic number (Q1621059) (← links)
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Efficient enumeration of graph orientations with sources (Q1647832) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- Monochromatic paths in random tournaments (Q1689907) (← links)
- Stable set meeting every longest path (Q1763350) (← links)
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (Q1783629) (← links)
- Diperfect graphs (Q1838975) (← links)
- Some Ramsey nu mbers for directed graphs (Q1846431) (← links)
- Density via duality. (Q1853500) (← links)
- Paths with two blocks in \(k\)-chromatic digraphs (Q1886358) (← links)
- Antidirected paths in 5-chromatic digraphs (Q1886962) (← links)
- Independent sets which meet all longest paths (Q1917489) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- On the strong and the semi-strong path partition conjecture (Q1985941) (← links)
- Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs (Q2000583) (← links)
