On arbitraly vertex decomposable unicyclic graphs with dominating cycle

DOI10.7151/DMGT.1332MaRDI QIDQ5437223zbMATH OpenOpenAlexFDO

Authors Sylwia Cichacz, Irmina A. Zioło

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)

Recommendations

• On domination multisubdivision number of unicyclic graphs
• Unicyclic graphs with equal domination and complementary tree domination numbers
• Uniform decompositions of complete multigraphs into cycles
• scientific article; zbMATH DE number 5238175
• On dissection of unicyclic graphs
• On decomposing the complete graph into the union of two disjoint cycles
• Null decomposition of unicyclic graphs
• scientific article; zbMATH DE number 60247
• scientific article; zbMATH DE number 3950581
• scientific article; zbMATH DE number 5627524

Cited in

(4)

• Unicyclic graphs with equal domination and complementary tree domination numbers
• Dense arbitrarily vertex decomposable graphs
• Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
• Arbitrarily vertex decomposable suns with few rays

This page was built for publication: On arbitraly vertex decomposable unicyclic graphs with dominating cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437223)