Completely Independent Spanning Trees in the Line Graphs of Complete Bipartite Graphs

锦城 赖

doi:10.12677/aam.2025.142054

ScienceGate Book Chapters

JOURNAL ARTICLE

Completely Independent Spanning Trees in the Line Graphs of Complete Bipartite Graphs

锦城赖

Year: 2025 Journal: Advances in Applied Mathematics Vol: 14 (02)Pages: 81-92

DOI: 10.12677/aam.2025.142054

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Bipartite graph Combinatorics Spanning tree Chordal graph Pathwidth Cograph 1-planar graph Discrete mathematics Indifference graph Line graph Graph

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.05

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Completely Independent Spanning Trees in the Line Graphs of Complete Bipartite Graphs

Metrics

Topics

Related Documents

Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs

Completely Independent Spanning Trees in Line Graphs

Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs

Completely independent spanning trees in the line graph of complete multipartite graphs

Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph