A shy invariant of graphs

DOI10.1007/S003730200027zbMath0991.05059OpenAlexW2059347663MaRDI QIDQ1606037

Raffaele Mosca

Publication date: 29 July 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200027

zbMATH Keywords

stable setgraph invariantessential graphcovering pairclique-coverclique-partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Polynomial time recognition of essential graphs having stability number equal to matching number

This page was built for publication: A shy invariant of graphs