Diagonalized Cartesian products of S-prime graphs are S-prime

DOI10.1016/J.DISC.2011.03.033zbMATH Open1232.05197DBLPjournals/dm/HellmuthOS12OpenAlexW2012965298WikidataQ56990570 ScholiaQ56990570MaRDI QIDQ658020FDOQ658020

Authors: Marc Hellmuth, Lydia Ostermeier, Peter F. Stadler 

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.03.033

Recommendations

• On subgraphs of Cartesian product graphs and S-primeness
• On subgraphs of Cartesian product graphs
• Unique prime Cartesian factorization of graphs over finite fields
• On subgraphs of Cartesian product graphs and S-primeness
• On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs

zbMATH Keywords

Cartesian product graphnontrivial path-\(k\)-coloring

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Characterizing subgraphs of Hamming graphs
• Topics in graph theory. Graphs and their Cartesian product
• A local prime factor decomposition algorithm
• On subgraphs of Cartesian product graphs
• On subgraphs of Cartesian product graphs and S-primeness
• Title not available (Why is that?)
• A new concept of primeness in graphs
• Title not available (Why is that?)

Cited In (7)

• A local prime factor decomposition algorithm
• Strong products of hypergraphs: unique prime factorization theorems and algorithms
• On subgraphs of Cartesian product graphs
• On subgraphs of Cartesian product graphs and S-primeness
• Fast factorization of Cartesian products of (directed) hypergraphs
• On the complexity of recognizing \(S\)-composite and \(S\)-prime graphs
• On subgraphs of Cartesian product graphs and S-primeness

This page was built for publication: Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658020)