Publication:5528475
From MaRDI portal
zbMath0149.21101MaRDI QIDQ5528475
Publication date: 1967
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C15: Coloring of graphs and hypergraphs
Related Items
WELL-COVERED GRAPHS: A SURVEY, Applications of matching and edge‐coloring algorithms to routing in clos networks, Some probabilistic restatements of the Four Color Conjecture, Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases, Unnamed Item, Paths with restricted degrees of their vertices in planar graphs, Unnamed Item, Unnamed Item, Unnamed Item, On fans in multigraphs, Unnamed Item, Bounded color functions on graphs, Polyhedral decompositions of cubic graphs, Ant optimal processing unit graph, Oriented Tait graphs, Acyclic colorings of planar graphs, A theorem on paths in planar graphs, A theorem on paths in planar 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, Minimal vertex Ramsey graphs and minimal forbidden subgraphs, Planar triangulations which quadrangulate other surfaces, Finding Hamiltonian cycles in Delaunay triangulations is NP-complete, Transformations of cubic graphs, Some remarks on the chromatic index of a graph, Über endliche, ebene Eulersche und paare, kubische Graphen, Wohlquasigeordnete Klassen endlicher Graphen, Jordan circuits of a graph, Graphs with forbidden subgraphs, Properties of the \(\phi\)-transformations of graphs and 2-manifolds, Arc colorings of digraphs, Meshes on 3-connected graphs, Hamiltonian lines in infinite graphs with few vertices of smll valency, A class of planar four-colorable graphs, Wagner's theorem for torus graphs, Normalformen planarer Graphen. II, An existence theorem for planar maps, Construction of quartic 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, An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring, Some sequential graph colouring algorithms, Vertex signatures and edge-4-colorings of 4-regular plane graphs, A generalization of edge-coloring in graphs, Unnamed Item, Cyclic coloration of 3-polytopes, Subcontraction-equivalence and Hadwiger's conjecture, A class of upper-embeddable graphs, Generating all planer graphs regular of degree four, The existence problem for colour critical linear hypergraphs, Sulla tracciabilita' di grafi finiti su superficie compatte, Edge-reconstruction of 4-connected planar graphs, Unnamed Item, Unnamed Item, Kuratowski's theorem, Topological subgraphs of cubic graphs and a theorem of dirac, Unnamed Item, Supereulerian graphs: A survey, Über Färbungen planarer Graphen II, Über asymmetrische Graphen, Unnamed Item, An attempt to understand the four color problem, A bibliographic survey of edge‐colorings, Using euler partitions to edge color bipartite multigraphs, On quadrangular convex 3-polytopes with at most two types of edges, Duality and perfection for edges in cliques, Guthrie's problem: new equivalences and rapid reductions, Packings and perfect path double covers of maximal planar graphs, An extension of a fixed point problem for simple graphs, 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, The clique-partitioning problem, A theory of rectangular dual graphs, Restricted matching in graphs of small genus, Intersection properties of boxes in \(R^ n\)., On 1-factorizability of Cayley graphs, Simplicial schemes, Independent sets in k-chromatic graphs, On Tutte polynomials and cycles of plane graphs, An algorithm for the characterization of the nonplanarity of a maximal graphical partition, Matching extension and the genus of a graph, A graph-theoretical characterization of the order complexes on the 2- sphere, On the Penrose number of cubic diagrams, Flows and generalized coloring theorems in graphs, Interval matroids and graphs, 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, 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, On the thickness of graphs of given degree, Note on inscribability of quadrangular polyhedra with restricted number of edge-types, A linear-time algorithm for finding an ambitus, On Hadwiger's number---A problem of the Nordhaus-Gaddum type, 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, Ü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, 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, 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, A note on partial 3-trees and homomorphism bases of graphs, Edge-reconstruction of minimally 3-connected planar graphs, Minors of quasi 4-connected graphs, Extending matchings in graphs: A survey, Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces, 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, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, A new proof of Grünbaum's 3 color theorem, On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs, A note on graph colorings and graph polynomials, A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, On weakly starlike multivalent functions, A new lower bound on the number of edges in colour-critical graphs and hypergraphs, Generating \(r\)-regular graphs, A planarity criterion for cubic bipartite graphs, On spin models, triply regular association schemes, and duality, Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion), Generating rooted triangulations without repetitions, Signed diagonal flips and the four color theorem, The class reconstruction number of maximal planar graphs, Even subgraph expansions for the flow polynomial of cubic plane maps, Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre
