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

Journal of Combinatorial Optimization - Netherlands
doi 10.1007/s10878-013-9642-8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

On Decompositions of a Multi-Graph Into Spanning Subgraphs

Bulletin of the American Mathematical Society
1974English

Decomposition of a Graph Into Two Disjoint Odd Subgraphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2018English

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

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Regular Subgraphs of a Regular Graph

Annals of the New York Academy of Sciences
GeneticsMolecular BiologyBiochemistryNeuroscienceHistoryPhilosophy of Science
1989English

On the Number of Dissimilar Line-Subgraphs of a Given Graph

Pacific Journal of Mathematics
Mathematics
1956English

On the Distance Function of a Connected Graph

Czechoslovak Mathematical Journal
Mathematics
2008English

A 4 + Ε Approximation for K-Connected Subgraphs

2020English

Partitioning Infinite Hypergraphs Into Few Monochromatic Berge-Paths

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2020English

A Large Deviation Result on the Number of Small Subgraphs of a Random Graph

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy