scientific article; zbMATH DE number 3307331
From MaRDI portal
zbMath0193.24301MaRDI QIDQ5588433
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the Complexity of Closest Pair via Polar-Pair of Point-Sets, Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority gates, Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs, Separability, boxicity, and partial orders, Proper colorability of segment intersection graphs, Better bounds for poset dimension and boxicity, On the sphericity of the graphs of semiregular polyhedra, On the optimal strongly connected orientations of city street graphs. IV: Four east-west avenues or north-south streets, Sphericity exceeds cubicity for almost all complete bipartite graphs, Extremal Values of the Interval Number of a Graph, A special planar satisfiability problem and a consequence of its NP- completeness, The Micro-world of Cographs, The micro-world of cographs, Structural parameterizations for boxicity, Finding hidden independent sets in interval graphs, Separation dimension of graphs and hypergraphs, Hamiltonian circuits in interval graph generalizations, Boxicity of graphs on surfaces, Induced Separation Dimension, Geometric representation of graphs in low dimension using axis parallel boxes, Poset boxicity of graphs, Boxicity and treewidth, A not 3-choosable planar graph without 3-cycles, Intersection properties of boxes. I: An upper-bound theorem, Thin strip graphs, Intersection graphs for families of balls in \(R^n\), Representability and boxicity of simplicial complexes, Space graphs and sphericity, No-hole \(k\)-tuple \((r+1)\)-distant colorings, On properties of unit interval graphs with a perceptual motivation, On dimensional properties of graphs, Homothetic polygons and beyond: maximal cliques in intersection graphs, Niche graphs, The hardness of approximating the boxicity, cubicity and threshold dimension of a graph, On the double competition number, On the thinness and proper thinness of a graph, Chronological rectangle digraphs which are two-terminal series-parallel, Local boxicity and maximum degree, Boxicity of line graphs, Cubicity and bandwidth, Sublinear approximation algorithms for boxicity and related problems, On Local Structures of Cubicity 2 Graphs, Upper bound on cubicity in terms of boxicity for graphs of low chromatic number, 2-role assignments on triangulated graphs., On the boxicity of Kneser graphs and complements of line graphs, Normal Helly circular-arc graphs and its subclasses, Optimal packing and covering in the plane are NP-complete, A note on the m-center problem with rectilinear distances, Local and union boxicity, Hardness of approximation for non-overlapping local alignments., Comparability graphs and intersection graphs, On grid intersection graphs, Representations of graphs and networks (coding, layouts and embeddings), Boxicity of leaf powers, Chordal bipartite graphs with high boxicity, Intersection properties of boxes. II: Extremal families, \(T\)-colorings of graphs: recent results and open problems, Boxicity, poset dimension, and excluded minors, Boxicity and topological invariants, Grid intersection graphs and boxicity, The coordinate representation of a graph and \(n\)-universal graph of radius 1, Covering boxes by points, Interval competition graphs of symmetric digraphs, Boxicity and maximum degree, Box representations of embedded graphs, Towards a comprehensive theory of conflict-tolerance graphs, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, Boxicity and cubicity of asteroidal triple free graphs, Ferrers dimension and boxicity, Sphericity, cubicity, and edge clique covers of graphs, On the cubicity of bipartite graphs, Characterization of the graphs with boxicity \(\leq 2\), Gallai-type results for multiple boxes and forests, Computing the boxicity of a graph by covering its complement by cointerval graphs, The induced separation dimension of a graph, Cubicity, degeneracy, and crossing number, The cubicity of hypercube graphs, The circular dimension of a graph, Representing graphs as the intersection of cographs and threshold graphs, A constant factor approximation algorithm for boxicity of circular arc graphs, Sphere of influence graphs and the \(L_{\infty}\)-metric, Boxicity of graphs with bounded degree, Cubicity, boxicity, and vertex cover, Cubicity of threshold graphs, An upper bound for cubicity in terms of boxicity, On nontransitive indifference, Boxicity of Halin graphs, Applications of edge coverings by cliques, What if utility functions do not exist?, On the Cubicity of AT-Free Graphs and Circular-Arc Graphs, On the cubicity of certain graphs, The Complexity of the Partial Order Dimension Problem, On the Complexity of Closest Pair via Polar-Pair of Point-Sets, On the sphericity and cubicity of graphs, A characterization of competition graphs, A characterization of competition graphs of arbitrary digraphs, On the Computation of the Competition Number of a Graph, Interval line graphs, Interval graphs and related topics, No-hole 2-distant colorings, On the chromatic number of multiple interval graphs and overlap graphs, Covering and coloring problems for relatives of intervals, The relationship between the threshold dimension of split graphs and various dimensional parameters, Boxicity and cubicity of product graphs, Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs, Irrepresentability by multiple intersection, or why the interval number is unbounded
