Certificates of factorisation for a class of triangle-free graphs
From MaRDI portal
Publication:2380230
zbMath1186.05057MaRDI QIDQ2380230
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231824
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Certificates for properties of stability polynomials of graphs ⋮ Non-bipartite chromatic factors ⋮ Short certificates for chromatic equivalence ⋮ Pairs of chromatically equivalent graphs ⋮ An infinite family of 2-connected graphs that have reliability factorisations
This page was built for publication: Certificates of factorisation for a class of triangle-free graphs
