Partitioning Infinite Hypergraphs Into Few Monochromatic Berge-Paths

Graphs and Combinatorics - Japan
doi 10.1007/s00373-019-02113-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Hypergraphs With Few Berge Paths of Fixed Length Between Vertices

SIAM Journal on Discrete Mathematics
Mathematics
2019English

Partitioning of Loop-Free Sperner Hypergraphs Into Transversals

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Covering Complete Partite Hypergraphs by Monochromatic Components

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2017English

A Note on Ramsey Numbers for Berge-G Hypergraphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Monochromatic Components in Edge-Colored Complete Uniform Hypergraphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

PaToH (Partitioning Tool for Hypergraphs)

2011English

Extension of Paths and Cycles for Hypergraphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2014English

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

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

Partitioning Hypergraphs in Scientific Computing Applications Through Vertex Separators on Graphs

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy