Factor-Critical Graphs with Given Number of Maximum Matchings

Yan Liu; Guiying Yan

doi:10.1007/s00373-008-0816-6

ScienceGate Book Chapters

JOURNAL ARTICLE

Factor-Critical Graphs with Given Number of Maximum Matchings

Yan Liu Guiying Yan

Year: 2008 Journal: Graphs and Combinatorics Vol: 24 (6)Pages: 563-569 Publisher: Springer Science+Business Media

DOI: 10.1007/s00373-008-0816-6

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Vertex (graph theory) Cograph Matching (statistics) Indifference graph Discrete mathematics Chordal graph Strong perfect graph theorem Graph 1-planar graph Statistics

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.07

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

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Factor-Critical Graphs with Given Number of Maximum Matchings

Metrics

Citation History

Topics

Related Documents

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

The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence

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

Matchings in graphs with a given number of cuts

Extremal Graphs With a Given Number of Perfect Matchings