scientific article; zbMATH DE number 3241107
From MaRDI portal
Publication:5528475
zbMath0149.21101MaRDI QIDQ5528475
No author found.
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 (only showing first 100 items - show all)
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
This page was built for publication:
