Ear Decomposition of Factor-Critical Graphs and Number of Maximum Matchings

Yan Liu; Shenlin Zhang

doi:10.1007/s40840-014-0092-y

ScienceGate Book Chapters

JOURNAL ARTICLE

Ear Decomposition of Factor-Critical Graphs and Number of Maximum Matchings

Yan Liu Shenlin Zhang

Year: 2015 Journal: Bulletin of the Malaysian Mathematical Sciences Society Vol: 38 (4)Pages: 1537-1549 Publisher: Springer Science+Business Media

DOI: 10.1007/s40840-014-0092-y

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Combinatorics Matching (statistics) Vertex (graph theory) Decomposition Discrete mathematics Graph Statistics Chemistry

Metrics

Cited By

0.65

FWCI (Field Weighted Citation Impact)

Refs

0.76

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

Ear Decomposition of Factor-Critical Graphs and Number of Maximum Matchings

Metrics

Citation History

Topics

Related Documents

Factor-Critical Graphs with Given Number of Maximum Matchings

Factor-critical graphs with the minimum number of near-perfect matchings

2-Connected factor-critical graphs G with exactly |E(G)| + 1 maximum matchings

Number of maximum matchings of bipartite graphs with positive surplus

Connected cubic graphs with the maximum number of perfect matchings