The forcing edge covering number of a graph

DOI10.1080/09720529.2011.10698335zbMath1244.05179OpenAlexW2010729687MaRDI QIDQ2892108

No author found.

Publication date: 18 June 2012

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/1147603H_14-3_pp249-259a.pdf

zbMATH Keywords

edge covering numberforcing edge covering number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Forcing matching numbers of fullerene graphs
• On the forced matching numbers of bipartite graphs
• The forcing Steiner number of a graph
• The forcing geodetic number of a graph

This page was built for publication: The forcing edge covering number of a graph