On the Number of Connected Convex Subgraphs of a Connected Acyclic Digraph

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2008.07.010
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

How to Make a Strongly Connected Digraph Two-Connected

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

On the Complexity of Partitioning a Graph Into a Few Connected Subgraphs

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2013English

Contractible Subgraphs in 3-Connected Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2000English

A 4 + Ε Approximation for K-Connected Subgraphs

2020English

On a Problem Connected With Strongly Convex Functions

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2016English

Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On 2-Connected Spanning Subgraphs With Low Maximum Degree

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1998English

A Characterization of Simply Connected Closed Arcwise Convex Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1951English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy