Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
type: Item
instance of: scholarly article
title: Equimatchable graphs are \(C_{2k+1}\)-free for \(k\geq 4\)
zbMATH Open document ID: 1343.05121
author: Cemil Dibek
author: Tınaz Ekim
author: Didem Gözüpek
author: Mordechai Shalom
published in: Discrete Mathematics
publication date: 2016-08-16T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6617192
zbMATH Keywords: equimatchable graph
zbMATH Keywords: forbidden subgraph
zbMATH Keywords: Gallai-Edmonds decomposition
zbMATH Keywords: factor-critical
MaRDI profile type: Publication
full work available at URL: j.disc.2016.06.003
OpenAlex ID: W2461993915
cites work: Efficient recognition of equimatchable graphs
cites work: Equimatchable Graphs on Surfaces
cites work: Equimatchable factor‐critical graphs
cites work: Q3565868
cites work: Matchings in polytopal graphs
cites work: Bounding the size of equimatchable graphs of fixed genus
cites work: On two equimatchable graph classes
cites work: Q3340896
cites work: Matching-perfect and cover-perfect graphs
cites work: Q3395507
cites work: WELL-COVERED GRAPHS: A SURVEY
cites work: Randomly matchable graphs
DOI: 10.1016/J.DISC.2016.06.003
description: scientific article; zbMATH DE number 6617192