On arbitraly vertex decomposable unicyclic graphs with dominating cycle

DOI10.7151/dmgt.1332zbMath1131.05071OpenAlexW1982081335MaRDI QIDQ5437223

Irmina A. Zioło, Sylwia Cichacz

Publication date: 18 January 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1332

Mathematics Subject Classification ID

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

Related Items

Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles