scientific article; zbMATH DE number 3404264
From MaRDI portal
zbMath0256.05108MaRDI QIDQ5670645
George Marble, Joel D. Isaacson, David W. Matula
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99)
Related Items
Hard-to-color graphs for connected sequential colorings, A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations, A graph coloring algorithm for large scale scheduling problems, The smallest hard-to-color graph for the SL algorithm, Expose-and-merge exploration and the chromatic number of a random graph, Mixed graph colorings, Simple decentralized graph coloring, Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring, Treewidth for graphs with small chordality, Complexity of Coloring Random Graphs, Graph Coloring Using Eigenvalue Decomposition, Unnamed Item, A multiobjective framework for heavily constrained examination timetabling problems, Average-case complexity of backtrack search for coloring sparse random graphs, Transformations for maximal planar graphs with minimum degree five, Bounded color functions on graphs, On the equality of the partial Grundy and upper ochromatic numbers of graphs, Chromatic optimisation: Limitations, objectives, uses, references, Improvements to MCS algorithm for the maximum clique problem, Heuristic for rapidly four-coloring large planar graphs, COSINE: A new graph coloring algorithm, The smallest hard-to-color graph, CIPFAR: a 3D unified numerical framework for the modeling of ductile fracture based on the phase field model and adaptive remeshing, Speeding up branch and bound algorithms for solving the maximum clique problem, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms, Approximation algorithms for combinatorial problems, On the chromatic number of graphs, Some applications of graph theory to clustering, Compactness and balancing in scheduling, A note on the complexity of the chromatic number problem, The clique-partitioning problem, Numerical experiences with graph coloring algorithms, Estimation of sparse hessian matrices and graph coloring problems
