On \(k\)-pairable regular graphs

DOI10.1016/j.disc.2010.07.025zbMath1221.05277OpenAlexW2022648605MaRDI QIDQ712262

Zhongyuan Che, Zhibo Chen

Publication date: 28 October 2010

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

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

zbMATH Keywords

regular graphCartesian productprime graphpair lengthpairable graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph multiplication
• Retract rigid Cartesian products of graphs
• Bipartite diametrical graphs of diameter 4 and extreme orders
• Uniquely pairable graphs
• Matching theory
• Cross-cloning and antipodal graphs
• On \(k\)-pairable graphs
• Pair lengths of product graphs
• On k-pairable graphs from trees
• Even graphs
• New Tricks for Old Trees: Maps and the Pigeonhole Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item

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