Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

Zemin Jin; Mikio Kanō; Xueliang Li; Bing Wei

doi:10.1007/s10878-006-8460-7

ScienceGate Book Chapters

JOURNAL ARTICLE

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

Zemin Jin Mikio Kanō Xueliang Li Bing Wei

Year: 2006 Journal: Journal of Combinatorial Optimization Vol: 11 (4)Pages: 445-454 Publisher: Springer Science+Business Media

DOI: 10.1007/s10878-006-8460-7

Get Full-Text PDF Get Analytical Report

Keywords:

Multipartite Combinatorics Mathematics 1-planar graph Cograph Bipartite graph Discrete mathematics Indifference graph NP-complete Vertex (graph theory) Chordal graph Pathwidth Decision problem Time complexity Graph Line graph Algorithm

Metrics

Cited By

2.00

FWCI (Field Weighted Citation Impact)

Refs

0.85

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees

Metrics

Citation History

Topics

Related Documents

Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Long monochromatic paths and cycles in 2-edge-colored multipartite graphs

Partitioning 2-edge-colored graphs by monochromatic paths and cycles

Partitioning edge-coloured complete graphs into monochromatic cycles and paths