Topology of Thin Film RC Circuits
From MaRDI portal
Publication:5521330
DOI10.1002/j.1538-7305.1966.tb01713.xzbMath0144.45601OpenAlexW2060144908MaRDI QIDQ5521330
Publication date: 1966
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1966.tb01713.x
Related Items
Finding a Maximum Clique in a Grounded 1-Bend String Graph, A special planar satisfiability problem and a consequence of its NP- completeness, Decidability of string graphs, On dominating set of some subclasses of string graphs, Forced pairs in \(A\)-Stick graphs, Cops and robbers on intersection graphs, Finding geometric representations of apex graphs is NP-hard, String graphs. II: Recognizing string graphs is NP-hard, On intersection representations of co-planar graphs, String graphs. I: The number of critical nonstring graphs is infinite, String graphs requiring exponential representations, Vertex intersection graphs of paths on a grid: characterization within block graphs, Intersection Graphs of Rays and Grounded Segments, Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs, Almost all string graphs are intersection graphs of plane convex sets, Separability, boxicity, and partial orders, Segment representation of a subclass of co-planar graphs, Proper colorability of segment intersection graphs, String graphs have the Erdős-Hajnal property, On the complexity of recognizing Stick, BipHook and max point-tolerance graphs, Coloring Hasse diagrams and disjointness graphs of curves, On String Graph Limits and the Structure of a Typical String Graph, String graphs and incomparability graphs, Refining the hierarchies of classes of geometric intersection graphs, An algorithm for the maximum weight independent set problem on outerstring graphs, Recognizing Proper Tree-Graphs, Crossing Number is NP-Complete, Thresholds for classes of intersection graphs, Grid intersection graphs and order dimension, Recognizing string graphs in NP, General lower bounds for the minor crossing number of graphs, On \(H\)-topological intersection graphs, Unnamed Item, A sharp threshold phenomenon in string graphs, Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid, Bounds on the bend number of split and cocomparability graphs, String graphs of k-bend paths on a grid, Outerstring Graphs are $\chi$-Bounded, A problem of Berge, Efficient Local Representations of Graphs, Hasse diagrams with large chromatic number, Graphs without \(K_ 4\) and well-quasi-ordering, Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure, Irrepresentability by multiple intersection, or why the interval number is unbounded, Almost all string graphs are intersection graphs of plane convex sets
