Pages that link to "Item:Q5539654"
From MaRDI portal
The following pages link to Nombre chromatique et plus longs chemins d'un graphe (Q5539654):
Displayed 37 items.
- 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)
- 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)
- Stable set meeting every longest path (Q1763350) (← 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 edge orienting methods for graph coloring (Q2385485) (← links)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
- Claws in digraphs (Q2473004) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- A note on strong perfectness of graphs (Q3714102) (← links)
- On greene's theorem for digraphs (Q4284103) (← links)
- On some properties of suboptimal colorings of graphs (Q4458722) (← links)
- Antidirected Hamiltonian paths in tournaments (Q5920985) (← links)
- Ramsey numbers for tournaments (Q5941503) (← links)