On k-pairable graphs from trees

DOI10.1007/s10587-007-0066-4zbMath1174.05106OpenAlexW2049104542MaRDI QIDQ3617959

Zhongyuan Che

Publication date: 31 March 2009

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/31135

zbMATH Keywords

treeCartesian productpair length\(k\)-pairable graph\(G\)-layer

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On \(k\)-pairable regular graphs ⋮ Uniquely pairable graphs

Cites Work

• On \(k\)-pairable graphs
• New Tricks for Old Trees: Maps and the Pigeonhole Principle

This page was built for publication: On k-pairable graphs from trees