scientific article; zbMATH DE number 3241107
From MaRDI portal
zbMath0149.21101MaRDI QIDQ5528475
Publication date: 1967
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
Independent sets in k-chromatic graphs, Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces, On Tutte polynomials and cycles of plane graphs, At most single-bend embeddings of cubic graphs, On the colorability of \(m\)-composed graphs, Diagonal flips in triangulations of surfaces, On the edge-reconstruction of 3-connected planar graphs with minimum valency 4, An algorithm for the characterization of the nonplanarity of a maximal graphical partition, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, A new proof of Grünbaum's 3 color theorem, Matching extension and the genus of a graph, On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs, A graph-theoretical characterization of the order complexes on the 2- sphere, A note on graph colorings and graph polynomials, Duality and perfection for edges in cliques, On the Penrose number of cubic diagrams, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, On doubly light triangles in plane graphs, Flows and generalized coloring theorems in graphs, Interval matroids and graphs, On weakly starlike multivalent functions, On a covering problem of Mullin and Stanton for binary matroids, Some counterexamples associated with the three-color problem, On the geometry of semigroup presentations, The enumeration problem for color critical linear hypergraphs, Critical hypergraphs for the weak chromatic number, A new lower bound on the number of edges in colour-critical graphs and hypergraphs, On dynamic coloring for planar graphs and graphs of higher genus, Kempe classes and the Hadwiger conjecture, Graphs having circuits with at least two chords, On the enumeration of chains in regular chain-groups, Shortness parameters of families of regular planar graphs in two or three types of faces, On the existence and connectivity of a class of maximal planar graphs, A theory of rectangular dual graphs, Ore's conjecture on color-critical graphs is almost true, On the thickness of graphs of given degree, Surface embedding of \((n,k)\)-extendable graphs, Note on inscribability of quadrangular polyhedra with restricted number of edge-types, A linear-time algorithm for finding an ambitus, Guthrie's problem: new equivalences and rapid reductions, On Hadwiger's number---A problem of the Nordhaus-Gaddum type, Characterizing 4-critical graphs with Ore-degree at most seven, Grassmann homomorphism and Hajós-type theorems, Packings and perfect path double covers of maximal planar graphs, An extension of a fixed point problem for simple graphs, Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, A manifold of pure Gibbs states of the Ising model on a Cayley tree, 6-valent analogues of Eberhard's theorem, Über minimale, nichtprojektive Graphen mit einer Kreuzhaube, The importance of being Euler, A practical approach to the chromatic partition problem, On parity patterns of even \(q\)-angulations, Properties of a planar cubic graph, Excess in critical graphs, Zum Basisproblem der nicht in die projektive Ebene einbettbaren Graphen. II, Change graphs of edge-colourings of planar cubic graphs, Separation of vertices by a circuit, Über die Querstücke minimaler, nicht-projektiver Graphen. II, Pairs of Hamiltonian circuits in 5-connected planar graphs, Transformations of edge-colourings of cubic graphs, Inégalités nouvelles dans le problème des quatre couleurs, The four-color theorem for small maps, Orienting planar graphs, The thickness and chromatic number of \(r\)-inflated graphs, Über n-fach zusammenhängende Eckenmengen in Graphen, Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes, Développements recents de la théorie des graphes, Pairs of edge-disjoint Hamiltonian circuits, On the depth of a planar graph, Un metodo canonico di riduzione e costruzione relativo a grafi planari massimali, On quadrangular convex 3-polytopes with at most two types of edges, Bridges and Hamiltonian circuits in planar graphs, Some 4-valent, 3-connected, planar, almost pancyclic graphs, Geometric coloring theory, Dichte Klassen konvexer Polytope, Hamiltonian circuits in prisms over certain simple 3-polytopes, Contractions of graphs: A theorem of Ore and an extremal problem, Restricted matching in graphs of small genus, Su di un problema di A. M. Hobbs, Hajos' graph-coloring conjecture: Variations and counterexamples, A remark on noncolorable cubic graphs, On an extension of the Grinberg theorem, Colouring problems, Lower bounds on the cover-index of a graph, Sulla cardinabilita delle classi di 6-5-grafi, An unavoidable set of configurations in planar trigangulations, The reconstruction of maximal planar graphs. II: Reconstruction, Triangles with restricted degrees of their boundary vertices in plane triangulations, Intersection properties of boxes in \(R^ n\)., Chromatic polynomials of connected graphs, Inductive definition of two restricted classes of triangulations, A new method of proving theorems on chromatic index, Toughness and Delaunay triangulations, A note on partial 3-trees and homomorphism bases of graphs, The clique-partitioning problem, On 1-factorizability of Cayley graphs, Edge-reconstruction of minimally 3-connected planar graphs, Simplicial schemes, Minors of quasi 4-connected graphs, Extending matchings in graphs: A survey, Strong list-chromatic index of planar graphs with Ore-degree at most seven, Transformations for maximal planar graphs with minimum degree five, Some results on \(k\)-critical \(P_5\)-free graphs, Acyclic colorings of planar graphs, \(k\)-critical graphs in \(P_5\)-free graphs, Construction of acyclically 4-colourable planar triangulations with minimum degree 4, Paths with restricted degrees of their vertices in planar graphs, Topological subgraphs of cubic graphs and a theorem of dirac, Minimal vertex Ramsey graphs and minimal forbidden subgraphs, Planar triangulations which quadrangulate other surfaces, Unnamed Item, Point partition numbers: decomposable and indecomposable critical graphs, A new approach for determining fuzzy chromatic number of fuzzy graph, On the density of \(C_7\)-critical graphs, WELL-COVERED GRAPHS: A SURVEY, A generalization of edge-coloring in graphs, Unnamed Item, Graph coloring and semidefinite rank, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, On the minimum number of edges in triangle-free 5-critical graphs, Graph \(r\)-hued colorings -- a survey, Supereulerian graphs: A survey, Vertex signatures and edge-4-colorings of 4-regular plane graphs, Transformations of cubic graphs, The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \), Unnamed Item, Applications of matching and edge‐coloring algorithms to routing in clos networks, Structure in sparse \(k\)-critical graphs, Bounded color functions on graphs, Unnamed Item, Generating \(r\)-regular graphs, Polyhedral decompositions of cubic graphs, Density of 5/2-critical graphs, Short proofs of coloring theorems on planar graphs, Splitter theorems for 4-regular graphs, Ant optimal processing unit graph, Oriented Tait graphs, Über Färbungen planarer Graphen II, Cyclic coloration of 3-polytopes, Complete colorings of planar graphs, Distance-two colourings of Barnette graphs, Über asymmetrische Graphen, Problems on pairs of trees and the four colour problem of planar graphs, Critical \((P_6, \mathrm{banner})\)-free graphs, Subcontraction-equivalence and Hadwiger's conjecture, Unnamed Item, The (\(n\), \(k\))-extendable graphs in surfaces, Hadwiger's conjecture and inflations of the Petersen graph, An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring, Some remarks on the chromatic index of a graph, A class of upper-embeddable graphs, Generating all planer graphs regular of degree four, The existence problem for colour critical linear hypergraphs, Unnamed Item, Some sequential graph colouring algorithms, A Brooks-type result for sparse critical graphs, A local epsilon version of Reed's conjecture, [https://portal.mardi4nfdi.de/wiki/Publication:4256105 Haj�s constructions of critical graphs], An attempt to understand the four color problem, Unnamed Item, \(k\)-critical graphs in \(P_5\)-free graphs, On spin models, triply regular association schemes, and duality, Sulla tracciabilita' di grafi finiti su superficie compatte, On fans in multigraphs, Edge-reconstruction of 4-connected planar graphs, Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion), Unnamed Item, Unnamed Item, Generating rooted triangulations without repetitions, A bibliographic survey of edge‐colorings, Hajós and Ore constructions for digraphs, Signed diagonal flips and the four color theorem, Über endliche, ebene Eulersche und paare, kubische Graphen, Wohlquasigeordnete Klassen endlicher Graphen, The class reconstruction number of maximal planar graphs, Jordan circuits of a graph, Graphs with forbidden subgraphs, Using euler partitions to edge color bipartite multigraphs, Properties of the \(\phi\)-transformations of graphs and 2-manifolds, Even subgraph expansions for the flow polynomial of cubic plane maps, Arc colorings of digraphs, Unnamed Item, Meshes on 3-connected graphs, Hamiltonian lines in infinite graphs with few vertices of smll valency, A class of planar four-colorable graphs, Generating 5-regular planar graphs, Wagner's theorem for torus graphs, Some probabilistic restatements of the Four Color Conjecture, Normalformen planarer Graphen. II, A theorem on paths in planar graphs, An existence theorem for planar maps, Construction of quartic graphs, A theorem on paths in planar graphs, Shortness exponents of families of graphs, Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth, Absolute planar retracts and the four colour conjecture, Link mutations and Goeritz matrices, Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre, A planarity criterion for cubic bipartite graphs, The number of edge 3-colorings of a planar cubic graph as a permanent, A lower bound for the independence number of a planar graph, Some of My Favorite Coloring Problems for Graphs and Digraphs, Kuratowski's theorem, Surface Embedding of Non-Bipartite $k$-Extendable Graphs, Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
