Lexicographic product of extendable graphs

MaRDI QIDQ974316zbMATH OpenFDO

Authors Bing Bai, Xu Yang, Qinglin Roger Yu, Zefang Wu

Publication date 27 May 2010

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/244440, http://math.usm.my/bulletin/html/vol33_2_3.html

zbMATH Keywords

perfect matchinglexicographic productfactor-criticality\(T \)-joinextendable 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)

Recommendations

• On matching extendability of lexicographic products
• On the strong product of a \(k\)-extendable and an \(l\)-extendable graph
• scientific article; zbMATH DE number 434908
• scientific article; zbMATH DE number 786151
• Matching and edge covering number on lexicographical product of cycles

Cited in

(8)

• Representable lexicographic products
• scientific article; zbMATH DE number 6470161 (Why is no real title available?)
• Construction of k-matchings in graph products
• On the strong product of a \(k\)-extendable and an \(l\)-extendable graph
• On the restricted matching extension of graphs on the torus and the Klein bottle
• On 2-extendable quasi-abelian Cayley graphs
• On matching extendability of lexicographic products
• Path-connectivity of lexicographic product graphs

This page was built for publication: Lexicographic product of extendable graphs

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