Combinatorial Geometry and Graph Theory
From MaRDI portal
Publication:5491719
DOI10.1007/b105263zbMath1117.05038MaRDI QIDQ5491719
Publication date: 10 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105263
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C17: Perfect graphs
Related Items
Online \(L(2,1)\)-coloring problem on paths with restricted size of memory, An \(O(n\log n)\) algorithm for finding edge span of cacti, The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones, The backbone coloring problem for bipartite backbones, On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles, On the hardness of computing span of subcubic graphs, The distant-2 chromatic number of random proximity and random geometric graphs, \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings, Optimal backbone coloring of split graphs with matching backbones, The computational complexity of the backbone coloring problem for planar graphs with connected backbones