scientific article
From MaRDI portal
Publication:3912613
zbMath0463.05041MaRDI QIDQ3912613
Thomas L. Saaty, Paul C. Kainen
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)
Related Items
Facial list colourings of plane graphs, Heawood inequalities, Facial packing edge-coloring of plane graphs, Map coloring and the vector cross product, Odd facial colorings of acyclic plane graphs, The Clar and Fries structures of a fullerene. I, A categorical setting for the 4-colour theorem, The chromatic connectivity of graphs, Zig-zag facial total-coloring of plane graphs, A bibliography on chromatic polynomials, Labeling angles of planar graphs, Duality and perfection for edges in cliques, Facially-constrained colorings of plane graphs: a survey, Lie algebras and the four color theorem, Gallai graphs and anti-Gallai graphs, A unified approach to layout wirability, Triangulations, On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes, Enclosure of the numerical range of a class of non-selfadjoint rational operator functions, Reviews Graph Theory in America: The First Hundred Years . By Robin Wilson, John J. Watkins, and David J. Parks, Princeton University Press, 2023. 320 pp., ISBN 978-0691194028, $35.00., Facial entire colouring of plane graphs, Parity vertex colouring of plane graphs, Cubic map configurations, Facial parity edge colouring of plane pseudographs, Zeroes of chromatic polynomials: A new approach to Beraha conjecture using quantum groups, Clar chains and a counterexample, Fullerenes with complete Clar structure, Potential energy function based on the narcissus constant, its square and its cube, Problems on pairs of trees and the four colour problem of planar graphs, Facial edge ranking of plane graphs, Guthrie's problem: new equivalences and rapid reductions, A simple dissertation around the Berge problem and the Hadwiger conjecture, Planar Eulerian triangulations are equivalent to spherical Latin bitrades, Counting 5-connected planar triangulations, Développements recents de la théorie des graphes, Topological notions for Kauffman and Vogel's polynomial, Efficient approximation algorithms for the achromatic number, Clar and fries numbers for benzenoids, An algebraic approach to the planar coloring problem, Signed diagonal flips and the four color theorem, Facilities layout generalized model solved by n-boundary shortest path heuristics, Signed permutations and the four color theorem, COLORING PLANAR GRAPHS VIA COLORED PATHS IN THE ASSOCIAHEDRA, Unique-maximum edge-colouring of plane graphs with respect to faces, Perfect Clar structures and 3-homogeneous simplicial complexes, 4-edge-coloring graphs of maximum degree 3 in linear time
