On k-pairable regular graphs

DOI10.1016/J.DISC.2010.07.025zbMATH Open1221.05277OpenAlexW2022648605MaRDI QIDQ712262FDOQ712262

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

Recommendations

• Minimum order of \(r\)-regular bipartite graphs of pair length \(k\)
• Sharp bounds on the size of pairable graphs and pairable bipartite graphs
• On \(k\)-pairable graphs
• On k-pairable graphs from trees
• Three-regular path pairable graphs

zbMATH Keywords

prime graphCartesian productregular 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 theory
• Matching theory
• Title not available (Why is that?)
• Graph multiplication
• Title not available (Why is that?)
• Uniquely pairable graphs
• Cross-cloning and antipodal graphs
• Even graphs
• Retract rigid Cartesian products of graphs
• On \(k\)-pairable graphs
• Pair lengths of product graphs
• On k-pairable graphs from trees
• New Tricks for Old Trees: Maps and the Pigeonhole Principle
• Bipartite diametrical graphs of diameter 4 and extreme orders

Cited In (7)

• Uniquely pairable graphs
• Title not available (Why is that?)
• On \(k\)-pairable graphs
• Title not available (Why is that?)
• Three-regular path pairable graphs
• Title not available (Why is that?)
• On k-pairable graphs from trees

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

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