An algorithmic note on the gallai-milgram theorem
From MaRDI portal
Publication:3033587
DOI10.1002/net.3230200104zbMath0691.90089OpenAlexW2005812575MaRDI QIDQ3033587
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200104
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Induced matchings in intersection graphs. ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Design of test inputs and their sequences in multi-function system testing ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
Cites Work
This page was built for publication: An algorithmic note on the gallai-milgram theorem
