About colorings, stability and paths in directed graphs

DOI10.1016/0012-365X(89)90206-9zbMATH Open0673.05038MaRDI QIDQ1120589FDOQ1120589

Authors: Henri Meyniel 

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3891403
• On the Berge's strong path partition conjecture
• On the strong path partition conjecture of Berge
• Path partitions and packs of acyclic digraphs
• On the complexity of the colorful directed paths in vertex coloring of digraphs

zbMATH Keywords

digraphcoloringpathmaximum stable set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• Covering digraphs by paths
• Diperfect graphs

Cited In (4)

• \(\alpha\)-diperfect digraphs
• Using stable sets to bound the chromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: About colorings, stability and paths in directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120589)