SIG-dimension conjecture proved for graphs having a perfect matching

DOI10.1142/S1793830917500082MaRDI QIDQ2966508zbMATH OpenWikidataFDO

Authors Ramanjit Kumar, Surinder Pal Singh

Publication date 7 March 2017

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

Full work available at URL https://doi.org/10.1142/S1793830917500082

zbMATH Keywords

\(\mathrm{SIG}\)-dimensionperfect matchingsphere-of-influencesup-norm

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• SIG-dimensional of \(K_{2,2}\)-free graphs
• Perfect matchings versus odd cuts
• scientific article; zbMATH DE number 741200
• The strong perfect graph theorem
• The perfect matchings without common edges in cubic graphs

Cites work

• scientific article; zbMATH DE number 3793444 (Why is no real title available?)
• On the SIG-dimension of trees under the L_-metric
• SIG-dimensional of \(K_{2,2}\)-free graphs
• Sphere of influence graphs and the \(L_{\infty}\)-metric
• Sphere of influence graphs in general metric spaces
• Sphere-of-influence graphs using the sup-norm

Cited in

(2)

• Induced star-triangle factors of graphs
• SIG-dimensional of \(K_{2,2}\)-free graphs

This page was built for publication: \(\mathrm{SIG}\)-dimension conjecture proved for graphs having a perfect matching

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