Packing two bipartite graphs into a complete bipartite graph

Hong Wang

doi:10.1002/(sici)1097-0118(199710)26:2<95::aid-jgt4>3.0.co;2-a

ScienceGate Book Chapters

JOURNAL ARTICLE

Packing two bipartite graphs into a complete bipartite graph

Hong Wang

Year: 1997 Journal: Journal of Graph Theory Vol: 26 (2)Pages: 95-104 Publisher: Wiley

DOI: 10.1002/(sici)1097-0118(199710)26:2<95::aid-jgt4>3.0.co;2-a

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Bipartite graph Mathematics Complete bipartite graph Edge-transitive graph Discrete mathematics Disjoint sets Vertex (graph theory) Cograph Robertson–Seymour theorem Graph Line graph 1-planar graph Graph power

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.45

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Packing two bipartite graphs into a complete bipartite graph

Metrics

Citation History

Topics

Related Documents

Packing two bipartite graphs into a complete bipartite graph

Packing trees into complete bipartite graphs

Packing complete bipartite graphs

On packing trees into complete bipartite graphs

On Packing Trees into Complete Bipartite Graphs