scientific article
From MaRDI portal
Publication:3220612
zbMath0556.05027MaRDI QIDQ3220612
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
achromatic numberchromatic polynomialcritical graphsconditional chromatic numberconditional chromatic indexconditional colorability
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs, Harary polynomials, The complexity of \(G\)-free colourability, Novel results on partial Hosoya polynomials: an application in chemistry, Induced-path partition on graphs with special blocks, On path-chromatically unique graphs, The existence of uniquely \(-G\) colourable graphs, The complexity of generalized graph colorings, The t-improper chromatic number of random graphs, ON UNIQUELY -G k-COLOURABLE GRAPHS, Nordhaus–Gaddum problem in terms of G-free coloring, Some bounds on the size of maximum G-free sets in graphs, Partitioning of a graph into induced subgraphs not containing prescribed cliques, Graph properties and hypergraph colourings, Co-2-plex vertex partitions, Improper colouring of (random) unit disk graphs, A hypocoloring model for batch scheduling, A logician's view of graph polynomials, Extremal \(G\)-free induced subgraphs of Kneser graphs, Local coloring of Kneser graphs, Interpolation theorems for a family of spanning subgraphs, Generalizations of independence and chromatic numbers of a graph, Conditional chromatic numbers with forbidden cycles, Minimum partition of an independence system into independent sets, Chromatic partitions of a graph, The subchromatic number of a graph, Generalized partitions of graphs, Computing Wiener and hyper-Wiener indices of zero-divisor graph of \(\mathbb{Z}_{g^3}\times\mathbb{Z}_{\mathfrak{I}_1\mathfrak{I}_2}\), A sequential coloring algorithm for finite sets, Interpolation theorems for graphs, hypergraphs and matroids, General vertex-distinguishing total coloring of graphs, Adjacent strong edge coloring of graphs
