scientific article; zbMATH DE number 1286503

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199812)29:4<209::AID-JGT1>3.0.CO;2-V" /><209::AID-JGT1>3.0.CO;2-V 10.1002/(SICI)1097-0118(199812)29:4<209::AID-JGT1>3.0.CO;2-VzbMath0919.05029MaRDI QIDQ4242951

Endre Boros, Frédéric Maffray, Gábor Bacsó, Myriam Preissmann, Vladimir A. Gurvich

Publication date: 31 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cyclesperfect graphscircular symmetrypartitionable graphsimperfect graphnear-factorizations of cyclic groups

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Elementary bipartite graphs and unique colourability ⋮ \(g\)-circulant solutions to the (0,1) matrix equation \(A^m=J_n\) ⋮ On CIS circulants ⋮ Grinstead's conjecture is true for graphs with a small clique number ⋮ An approach to solving \(A^{k}=J-I\) ⋮ Cayley partitionable graphs and near-factorizations of finite groups ⋮ On Moore bipartite digraphs ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution

This page was built for publication: