Algebraic expressions of grid graphs with diagonal edges
From MaRDI portal
Cites work
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
- Domination polynomials of the grid, the cylinder, the torus, and the king graph
- Encoding paths with binary arrays in a king's graph for error-free data transmission
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Factoring Boolean functions using graph partitioning
- Generalized Fibonacci maximum path graphs
- Generating algebraic expressions for labeled grid graphs
- scientific article; zbMATH DE number 2040952 (Why is no real title available?)
- scientific article; zbMATH DE number 1555952 (Why is no real title available?)
- scientific article; zbMATH DE number 5065241 (Why is no real title available?)
- On \(k\)-resonance of grid graphs on the plane, torus and cylinder
- On forced periodicity of perfect colorings
- Optimal Reduction of Two-Terminal Directed Acyclic Graphs
- Some systems of simultaneous linear recurrences and their applications to computing of graph expression lengths
- Spanning tree congestion of planar graphs
This page was built for publication: Algebraic expressions of grid graphs with diagonal edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307330)