Edge coloring lattice graphs
From MaRDI portal
Combinatorial aspects of tessellation and tiling problems (05B45) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Quantum computation (81P68) Computational stability and error-correcting codes for quantum computation and communication processing (81P73) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites work
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- A constructive proof of Vizing's theorem
- A guide to graph colouring. Algorithms and applications
- An Embedding Theorem for Algebric Systems
- Anschauliche Geometrie.
- Cluster-state quantum computation
- Every planar graph with maximum degree 7 is of class 1
- Every Planar Map is Four Colorable
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- scientific article; zbMATH DE number 5278955 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 845648 (Why is no real title available?)
- scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3378939 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 3068973 (Why is no real title available?)
- Inclusions and non-inclusions among the Archimedean and Laves lattices, with applications to bond percolation thresholds
- Introduction to algorithms.
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- On an estimate of the chromatic class of a \(p\)-graph
- On the colouring of maps.
- Optimized noise suppression for quantum circuits
- Planar graphs of maximum degree seven are Class I
- Quantum computation and quantum information. 10th anniversary edition
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The NP-Completeness of Edge-Coloring
- Tilings by regular polygons. II: A catalog of tilings
- Universal Quantum Simulators
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
This page was built for publication: Edge coloring lattice graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973813)
