Lexicographic product of extendable graphs

zbMath1189.05141MaRDI QIDQ974316

Qinglin Yu, Xu Yang, Bing Bai, 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

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)

Related Items (4)

Construction of k-matchings in graph products ⋮ On matching extendability of lexicographic products ⋮ On the restricted matching extension of graphs on the torus and the Klein bottle ⋮ On 2-extendable quasi-abelian Cayley graphs

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