Uniquely pairable graphs

DOI10.1016/J.DISC.2007.11.029zbMATH Open1205.05197OpenAlexW2041453806MaRDI QIDQ998347FDOQ998347

Authors: Zhongyuan Che 

Publication date: 28 January 2009

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

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

Recommendations

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

zbMATH Keywords

involutionprime graphautomorphismCartesian productprime factor decompositionpairable graphsemi-pairable graphuniquely pairable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph multiplication
• On \(k\)-pairable graphs
• Pair lengths of product graphs
• On k-pairable graphs from trees

Cited In (6)

• On \(k\)-pairable regular graphs
• Uniquely tree-saturated graphs
• Sharp bounds on the size of pairable graphs and pairable bipartite graphs
• On \(k\)-pairable graphs
• On k-pairable graphs from trees
• Uniquely edge extendible graphs

This page was built for publication: Uniquely pairable graphs

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