Factoring a graph in polynomial time
From MaRDI portal
Publication:579285
DOI10.1016/S0195-6698(87)80012-4zbMath0625.05050MaRDI QIDQ579285
Publication date: 1987
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
Factoring cartesian‐product graphs, Computing equivalence classes among the edges of a graph with applications, Finding the prime factors of strong direct product graphs in polynomial time, A note on Winkler's algorithm for factoring a connected graph, Recognizing Cartesian products in linear time, Strict refinement for graphs and digraphs, Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time, Cartesian graph factorization at logarithmic cost per edge, Strong products of Kneser graphs, Recognizing Cartesian graph bundles, Factoring cardinal product graphs in polynomial time, Algorithm for recognizing Cartesian graph bundles, Strong products of \(\chi\)-critical graphs, On the complexity of the embedding problem for hypercube related graphs, Unnamed Item, Product graph representations
Cites Work
