Terminal-Pairability in Complete Bipartite Graphs

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

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Eigensharp Graphs: Decomposition Into Complete Bipartite Subgraphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Some Applications of Spanning Trees in Complete and Complete Bipartite Graphs

American Journal of Applied Sciences
Multidisciplinary
2012English

Kp,q-Factorization of Complete Bipartite Graphs

Science in China Series A
2004English

Complexity of Products of Some Complete and Complete Bipartite Graphs

Journal of Applied Mathematics
Applied Mathematics
2013English

Evaluation Codes Associated to Some Weighted Complete Bipartite Graphs

International Journal of Contemporary Mathematical Sciences
2013English

Dispersed Points and Geometric Embedding of Complete Bipartite Graphs

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1991English

A Note on the Equitable Choosability of Complete Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Domination in Bipartite Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy