On connected 2-\(K_n\)-residual graphs

DOI10.1007/s00009-012-0230-4zbMath1263.05053OpenAlexW2024544980WikidataQ57853196 ScholiaQ57853196MaRDI QIDQ1949837

Jiangdong Liao, Shihui Yang, Yong Deng

Publication date: 17 May 2013

Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00009-012-0230-4

zbMATH Keywords

Cartesian productcomposite graphresidual-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Two improvements on the Erdős, Harary and Klawe conjecture

Cites Work

• Residually-Complete Graphs

This page was built for publication: On connected 2-\(K_n\)-residual graphs