On the number of connected convex subgraphs of a connected acyclic digraph

DOI10.1016/j.dam.2008.07.010zbMath1228.05173OpenAlexW2012492419MaRDI QIDQ1028149

Anders Yeo, Gregory Gutin

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.07.010

zbMATH Keywords

enumerationacyclic digraphsconnected subgraphsconvex subgraphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

A general framework for path convexities ⋮ Convex sets in acyclic digraphs ⋮ Algorithms for generating convex sets in acyclic digraphs ⋮ Acyclic Digraphs

Cites Work

• An algorithm for finding input-output constrained convex sets in an acyclic digraph

This page was built for publication: On the number of connected convex subgraphs of a connected acyclic digraph