Edge-colorability of graph bundles
From MaRDI portal
Publication:1835926
DOI10.1016/0095-8956(83)90076-XzbMath0505.05034MaRDI QIDQ1835926
John Shawe-Taylor, Tomaž Pisanski, Joze Vrabec
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Generalizations of fiber spaces and bundles in algebraic topology (55R65)
Related Items (25)
Algorithm for recognizing Cartesian graph bundles ⋮ Cyclic bundle Hamiltonicity ⋮ Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) ⋮ Fault-diameter of Cartesian graph bundles ⋮ Fault diameter of product graphs ⋮ The maximum genus of graph bundles ⋮ Recognizing Cartesian graph bundles ⋮ Weighted complexities of graph products and bundles ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ On strong graph bundles ⋮ Unique square property, equitable partitions, and product-like graphs ⋮ Unnamed Item ⋮ Graph bundles and Ricci‐flatness ⋮ Mixed fault diameter of Cartesian graph bundles ⋮ Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles ⋮ The fault-diameter of Cartesian products ⋮ An algorithm forK-convex closure and an application ⋮ Domination of generalized Cartesian products ⋮ Wide diameter of Cartesian graph bundles ⋮ The edge fault-diameter of Cartesian graph bundles ⋮ Graphs G for which G and \(\bar G\) are both semidecomposable ⋮ Edge-colorability of graph bundles ⋮ The chromatic numbers of graph bundles over cycles ⋮ The grid property and product-like hypergraphs ⋮ Perfect codes in direct graph bundles
Cites Work
This page was built for publication: Edge-colorability of graph bundles
