On \(k\)-pairable graphs

DOI10.1016/j.disc.2004.04.012zbMath1050.05026OpenAlexW2092103617MaRDI QIDQ1886336

Zhibo Chen

Publication date: 18 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.012

zbMATH Keywords

Spanning treeCycleProduct graph\(k\)-pairable graphAntipodal isomorphismPair length

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (6)

Bipartite diametrical graphs of diameter 4 and extreme orders ⋮ On \(k\)-pairable regular graphs ⋮ Pair lengths of product graphs ⋮ Uniquely pairable graphs ⋮ On k-pairable graphs from trees ⋮ Enumerating spanning trees of graphs with an involution

Cites Work

• Unnamed Item
• Unnamed Item
• New Tricks for Old Trees: Maps and the Pigeonhole Principle

This page was built for publication: On \(k\)-pairable graphs