Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897544
DOI10.1007/11604686zbMath1126.05302MaRDI QIDQ5897544
Marc Noy, Omer Giménez, Petr Hliněný
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Leaves for packings with block size four, Bipartite graphs as polynomials and polynomials as bipartite graphs, A Most General Edge Elimination Polynomial, An extension of the bivariate chromatic polynomial, Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width