Strict refinement for graphs and digraphs

DOI10.1016/0095-8956(87)90018-9MaRDI QIDQ1072575zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1332355
• On strict (outer-)confluent graphs
• On strict (outer-)confluent graphs
• Refined finiteness and degree properties in graphs
• On strict-double-bound numbers of graphs and graph operations
• Note on strict-double-bound graphs and numbers
• On strict semibound graphs of posets
• Strict optimal rubbling of graphs
• scientific article; zbMATH DE number 6181702
• A refinement of choosability of graphs

Cites work

• scientific article; zbMATH DE number 3834029 (Why is no real title available?)
• scientific article; zbMATH DE number 3889587 (Why is no real title available?)
• scientific article; zbMATH DE number 3786842 (Why is no real title available?)
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Automorphisms and products of ordered sets
• Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
• Factoring a graph in polynomial time
• Graph multiplication
• On Isometric Embeddings of Graphs
• On direct product desomposition of partially ordered sets
• Refinement properties for relational structures

Cited in

(9)

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

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)