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
Algorithm for recognizing Cartesian graph bundles, Strong products of Kneser graphs, Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time, Recognizing Cartesian graph bundles, Recognizing Cartesian products in linear time, Product graph representations, Factoring cartesian‐product graphs, Recognizing some complementary products, Unnamed Item, Factorization and pseudofactorization of weighted graphs, Robust Factorizations and Colorings of Tensor Graphs, Fast factorization of Cartesian products of (directed) hypergraphs, On Cartesian products of signed 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, Direct product primality testing of graphs is GI-hard, Cartesian graph factorization at logarithmic cost per edge, Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time, Strong products of \(\chi\)-critical graphs, On the complexity of the embedding problem for hypercube related graphs, On Some Graph Operations and Related Applications, Factoring cardinal product graphs in polynomial time, Strict refinement for graphs and digraphs
Cites Work
