Cyclomatic numbers of connected induced subgraphs

DOI10.1016/0012-365X(92)90150-EzbMath0783.05065OpenAlexW2077257901MaRDI QIDQ1199496

Xingxing Yu

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90150-e

zbMATH Keywords

upper boundsindependent setinduced subgraphscyclomatic number

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 (2)

Cyclomatic numbers of planar graphs ⋮ Line graphs: Their maximum nullities and zero forcing numbers

Cites Work

• Unnamed Item
• Research problems

This page was built for publication: Cyclomatic numbers of connected induced subgraphs