Strict refinement for graphs and digraphs

DOI10.1016/0095-8956(87)90018-9zbMATH Open0587.05056OpenAlexW2082558966MaRDI QIDQ1072575FDOQ1072575

James W. Walker

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(87)90018-9

zbMATH Keywords

connected graphisometric embeddingCartesian productunique factorizationstrict refinement

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph multiplication
• On Isometric Embeddings of Graphs
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Factoring a graph in polynomial time
• Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
• Refinement properties for relational structures
• On direct product desomposition of partially ordered sets
• Automorphisms and products of ordered sets

Cited In (9)

• Products of abstract polytopes
• The semigroup of metric measure spaces and its infinitely divisible probability measures
• Finding the prime factors of strong direct product graphs in polynomial time
• Groups for which it is easy to detect graphical regular representations
• Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
• Title not available (Why is that?)
• Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
• Digraphs with small automorphism groups that are Cayley on two nonisomorphic groups
• \(\mathcal{M}\)-coextensive objects and the strict refinement property

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Note on strict-double-bound graphs and numbers 👍 👎
• On strict-double-bound numbers of graphs and graph operations 👍 👎
• A refinement of choosability of graphs 👍 👎
• Refined finiteness and degree properties in graphs 👍 👎
• On strict (outer-)confluent graphs 👍 👎
• On Strict (Outer-)Confluent Graphs 👍 👎
• Strict optimal rubbling of graphs 👍 👎

This page was built for publication: Strict refinement for graphs and digraphs

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