SIG-dimension conjecture proved for graphs having a perfect matching
From MaRDI portal
Publication:2966508
DOI10.1142/S1793830917500082zbMath1358.05232WikidataQ123190230 ScholiaQ123190230MaRDI QIDQ2966508
Surinder Pal Singh Kainth, Ramanjit Kumar
Publication date: 7 March 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
This page was built for publication: SIG-dimension conjecture proved for graphs having a perfect matching