Digraphs Products
From MaRDI portal
Publication:3120442
DOI10.1007/978-3-319-71840-8_10zbMath1407.05111OpenAlexW4239439756MaRDI QIDQ3120442
Publication date: 4 March 2019
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_10
Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Lexicographic product of digraphs and related boundary-type sets, Packing strong subgraph in digraphs, Unnamed Item, Spectral theory of products of digraphs, Boundary-type sets of strong product of directed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination number of Cartesian product of directed paths
- On the Cartesian skeleton and the factorization of the strong product of digraphs
- A note on the oriented chromatic number of grids
- Competition hypergraphs of products of digraphs
- Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs
- Products of digraphs and their competition graphs
- A note concerning paths and independence number in digraphs
- Wielandt type theorem for Cartesian product of digraphs
- On the oriented chromatic number of grids
- The exponent of Cartesian product of cycles
- Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
- Hamiltonian decomposition of lexicographic products of digraphs
- On the arc-chromatic number of a digraph
- The chainable matrix, a special combinatorial matrix
- On \((k,l)\)-kernels in generalized products
- The exponent of a digraph and the diameter of its multiple direct product
- Cancellation of digraphs over the direct product
- Weak connectedness of tensor product of digraphs
- Paths and stability number in digraphs
- Zero divisors among digraphs
- Hamilton decompositions of directed cubes and products
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
- On the cancellation law among finite relational structures
- Das lexikographische Produkt gerichteter Graphen. (The lexicographic product of directed graphs)
- The categorical product of two 5-chromatic digraphs can be 3-chromatic
- Unzerlegbare, nicht negative Matrizen
- Oriented colouring of some graph products
- Cancellation of direct products of digraphs
- Factoring directed graphs with respect to the cardinal product in polynomial time II
- Exponents and diameters of strong products of digraphs
- Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
- On (k,l)-kernels in D-join of digraphs
- Factoring directed graphs with respect to the cardinal product in polynomial time
- On Cartesian skeletons of graphs
- Lexicographic Products and a Conjecture of Hahn and Jackson
- When the cartesian product of directed cycles is Hamiltonian
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
- On the Product of Directed Graphs
- Connectedness of Products of Two Directed Graphs
- Cardinal multiplication of structures with a reflexive relation
- Oriented graph coloring
