Directed acyclic graphs with the unique dipath property
From MaRDI portal
Publication:393144
DOI10.1016/j.tcs.2012.06.015zbMath1301.05144OpenAlexW2012123623MaRDI QIDQ393144
Jean-Claude Bermond, Michel Cosnard, Stéphane Pérennes
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.015
chromatic numberintersection graphsdirected acyclic graphsloadconflict graphsDAGdipathsgood labelingswavelengths
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- Intersection graphs of paths in a tree
- Chromatic number, girth and maximal degree
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- Traffic grooming on the path
- Good edge-labelling of graphs
This page was built for publication: Directed acyclic graphs with the unique dipath property