Gridline graphs: A review in two dimensions and an extension to higher dimensions

DOI10.1016/S0166-218X(02)00200-7zbMath1009.05118OpenAlexW2109462880MaRDI QIDQ1861575

D. L. Peterson

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00200-7

zbMATH Keywords

perfect graphclique graphadjacency graphchecked graphgraph of a (0-1)-matrixgridline graphlinegraph of a bipartite graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (8)

Partition-based discrete-time quantum walks ⋮ On line graphs of subcubic triangle-free graphs ⋮ Independent sets in Line of Sight networks ⋮ Finding Large Independent Sets in Line of Sight Networks ⋮ The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness ⋮ Dynamic programming optimization in line of sight networks ⋮ Induced Embeddings into Hamming Graphs. ⋮ Eigenbasis of the evolution operator of 2-tessellable quantum walks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels in perfect line-graphs
• Coloring perfect \((K_ 4\)-e)-free graphs
• Convergence of iterated clique graphs
• Sequential colorings and perfect graphs
• The list chromatic index of a bipartite multigraph
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• On the Line Graph of the Complete Bipartite Graph

This page was built for publication: Gridline graphs: A review in two dimensions and an extension to higher dimensions