On the edge-independence number and edge-covering number for regular graphs

DOI10.1515/DMA.1992.2.1.1zbMATH Open0804.03029OpenAlexW2089257943MaRDI QIDQ4318600

Yu. V. Golunkov

Publication date: 5 January 1995

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

Full work available at URL: https://doi.org/10.1515/dma.1992.2.1.1

zbMATH Keywords

completenessdecidabilitypartial recursive functionsalgorithmic algebrasfunctional system of program typeprogramm schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Recursive functions and relations, subrecursive hierarchies (03D20)

This page was built for publication: On the edge-independence number and edge-covering number for regular graphs