Incidence matrices and interval graphs
From MaRDI portal
Publication:2395457
DOI10.2140/pjm.1965.15.835zbMath0132.21001OpenAlexW2089465933WikidataQ55952668 ScholiaQ55952668MaRDI QIDQ2395457
Publication date: 1965
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1965.15.835
Related Items
Linear-Time Generation of Random Chordal Graphs, Efficient parallel algorithms for bipartite permutation graphs, Characterizing circular-arc graphs, Reconstruction of Interval Graphs, A simple linear time algorithm for triangulating three-colored graphs, Space-efficient algorithms for reachability in directed geometric graphs, Extending partial representations of circular-arc graphs, A Model for Birdwatching and other Chronological Sampling Activities, Linear optimization over homogeneous matrix cones, Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations, Coloring rings, On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs, Minimum cost flow problem with conflicts, Polynomial Kernel for Interval Vertex Deletion, On the edge‐biclique graph and the iterated edge‐biclique operator, Exponential neighborhood search for consecutive block minimization, Coloring \((4K_1,C_4,C_6)\)-free graphs, Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs, Isabelle formalisation of original representation theorems, MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling, On semi-transitive orientability of split graphs, Cycle intersection in spanning trees: a shorter proof of a conjecture and applications, Exact algorithms for restricted subset feedback vertex set in chordal and split graphs, The parallel complexity of elimination ordering procedures, Dually chordal graphs, On characterizing proper max-point-tolerance graphs, Finding biclique partitions of co-chordal graphs, Combinatorial Generation via Permutation Languages. V. Acyclic Orientations, Partial orders of dimension 2, Localization in 1D non-parametric latent space models from pairwise affinities, On 3-degree 4-chordal graphs, Independence polynomials and hypergeometric series, Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC, On domination elimination orderings and domination graphs, Dominoes, Algorithms for a maximum clique and a maximum independent set of a circle graph, Min-Orderable Digraphs, Hardness results of global Roman domination in graphs, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, Hardness results of global total \(k\)-domination problem in graphs, Consecutive ones matrices for multi-dimensional orthogonal packing problems, Analysis of upper bounds for the pallet loading problem, Strong spatial mixing in homomorphism spaces, Totally positive matrices and totally positive hypergraphs, Intersection graphs of non-crossing paths, Biclique graphs and biclique matrices, Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs, On the complexity of alpha conversion, On Physical Mapping and the consecutive ones property for sparse matrices, Minimizing phylogenetic number to find good evolutionary trees, On \(H\)-topological intersection graphs, Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs, Two strikes against perfect phylogeny, Complexity and algorithms for semipaired domination in graphs, Poincaré-Hopf inequalities, Hardness and structural results for half-squares of restricted tree convex bipartite graphs, Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs, Contracting chordal graphs and bipartite graphs to paths and trees, Unnamed Item, The homotopy theory of polyhedral products associated with flag complexes, Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited, Linear-Time Recognition of Probe Interval Graphs, Reconfiguration of Colorable Sets in Classes of Perfect Graphs, Graph Classes and Forbidden Patterns on Three Vertices, Hamiltonian Chordal Graphs are not Cycle Extendable, A separator-based method for generating weakly chordal graphs, Unnamed Item, On the maximum number of edges in chordal graphs of bounded degree and matching number, A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs, Customizable Contraction Hierarchies, Minimal triangulations of graphs: a survey, A vertex incremental approach for maintaining chordality, Minimal separators in \(P_4\)-sparse graphs, Lex M versus MCS-M, On the effectiveness of the incremental approach to minimal chordal edge modification, An optimal algorithm to recognize Robinsonian dissimilarities, Reactive and proactive single-machine scheduling to maintain a maximum number of starting times, A generalization of chordal graphs and the maximum clique problem, The recognition of geodetically connected graphs, Consecutive retrieval property -- revisited, Solving the all-pairs-shortest-length problem on chordal bipartite graphs, Vertex rankings of chordal graphs and weighted trees, Inducing a blockmodel structure of two-mode binary data using seriation procedures, Homological properties of determinantal arrangements, Max point-tolerance graphs, A sufficient condition to extend polynomial results for the maximum independent set problem, Algorithmic aspects of open neighborhood location-domination in graphs, Alexandrov's inequality and conjectures on some Toeplitz matrices, Triangulated neighborhoods in even-hole-free graphs, Tree loop graphs, Recognizing graphs without asteroidal triples, Reconstruction of interval graphs, Minimal dominating sets in graph classes: combinatorial bounds and enumeration, A note on the \(\epsilon\)-indicator subset selection, A Dirac-type characterization of \(k\)-chordal graphs, Recognition and characterization of chronological interval digraphs, Homotopy equivalence in finite digital images, Interval scheduling and colorful independent sets, Organizing the atoms of the clique separator decomposition into an atom tree, An improved algorithm for the red-blue hitting set problem with the consecutive ones property, Complexity of total outer-connected domination problem in graphs, Reduced clique graphs of chordal graphs, Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms, The shield that never was: societies with single-peaked preferences are more open to manipulation and control, A multi-stage stochastic programming approach in master production scheduling, Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances, Almost every graph is divergent under the biclique operator, Distributed computing of efficient routing schemes in generalized chordal graphs, Computing feasible toolpaths for 5-axis machines, Computing role assignments of proper interval graphs in polynomial time, A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix, Algorithmic aspects of \(k\)-tuple total domination in graphs, Crown-free lattices and their related graphs, Faster parameterized algorithms for \textsc{Minimum Fill-in}, Fair cost allocations under conflicts - a game-theoretic point of view -, Modeling recreational systems using optimization techniques and information technologies, Characterizing and computing the structure of clique intersections in strongly chordal graphs, Intersection representations of matrices by subtrees and unicycles on graphs, Counting the number of independent sets in chordal graphs, Orientations of graphs with prescribed weighted out-degrees, The complexity of manipulative attacks in nearly single-peaked electorates, Interval graph representation with given interval and intersection lengths, Minimal obstructions for partial representations of interval graphs, Continuation methods for approximate large scale object sequencing, \texttt{PQser:} a Matlab package for spectral seriation, On the non-unit count of interval graphs, On a class of graphs between threshold and total domishold graphs, Edge domination on bipartite permutation graphs and cotriangulated graphs, A note on lexicographic breadth first search for chordal graphs, Efficient parallel recognition of some circular arc graphs. II, The list distinguishing number equals the distinguishing number for interval graphs, Unit interval editing is fixed-parameter tractable, Strict chordal and strict split digraphs, Structure of concurrency, Counting endpoint sequences for interval orders and interval graphs, Line-distortion, bandwidth and path-length of a graph, Basic derivations for subarrangements of Coxeter arrangements, Bruhat order, smooth Schubert varieties, and hyperplane arrangements, Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings, A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs, A faster algorithm for finding minimum Tucker submatrices, Treewidth computations. I: Upper bounds, Separator orders in interval, cocomparability, and AT-free graphs, A characterization of signed graphs with generalized perfect elimination orderings, Bridges between deterministic and probabilistic models for binary data, On the complexity of recognizing directed path families, A new characterization of matrices with the consecutive ones property, Absolute retracts and varieties generated by chordal graphs, On the complexity of computing treelength, Approximation and fixed-parameter algorithms for consecutive ones submatrix problems, On listing, sampling, and counting the chordal graphs with edge constraints, Selected combinatorial problems of computational biology, A Nice labelling for tree-like event structures of degree 3, Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs, A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs, Algorithmic aspects of \(b\)-disjunctive domination in graphs, Computing the boxicity of a graph by covering its complement by cointerval graphs, On split-coloring problems, Algorithms for unipolar and generalized split graphs, Efficient algorithms for network localization using cores of underlying graphs, Special eccentric vertices for the class of chordal graphs and related classes, Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\), Dual parameterization of weighted coloring, Optimal weighing designs with a string property, Some aspects of perfect elimination orderings in chordal graphs, Separating subgraphs in k-trees: Cables and caterpillars, Circular representation problem on hypergraphs, Finding maximum cliques in arbitrary and in special graphs, On the isomorphism problem for Helly circular-arc graphs, Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs, LS-category of moment-angle manifolds and higher order Massey products, Optimal patchings for consecutive ones matrices, Optimal decomposition by clique separators, Tuple domination on graphs with the consecutive-zeros property, On the iterated edge-biclique operator, Generating and characterizing the perfect elimination orderings of a chordal graph, Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems, Chordal probe graphs, The story of perfectly orderable graphs, Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree, Permuting matrices to avoid forbidden submatrices, Well-partitioned chordal graphs, Note on maximal split-stable subgraphs, Hardness results of connected power domination for bipartite graphs and chordal graphs, Negative results on characterizing visibility graphs, 2-nested matrices: towards understanding the structure of circle graphs, On graphs without \(P_ 5\) and \(\overline {P}_ 5\), Graph searches and their end vertices, The DP color function of joins and vertex-gluings of graphs, Characterizations of fuzzy interval graphs, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, On preemptive scheduling: A general setting for the two-phase method, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, Perfect elimination orderings for symmetric matrices, Exploiting sparsity for the min \(k\)-partition problem, Extending partial representations of interval graphs, On strictly chordality-\(k\) graphs, 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs, Chronological rectangle digraphs which are two-terminal series-parallel, Characterizing interval graphs which are probe unit interval graphs, A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree, Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS, MPQ-trees for the orthogonal packing problem, A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs, Average Betti numbers of induced subcomplexes in triangulations of manifolds, On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs, Finding induced paths of given parity in claw-free graphs, The \(k\)-in-a-path problem for claw-free graphs, A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph, The conditional covering problem on unweighted interval graphs with nonuniform coverage radius, Integral mixed unit interval graphs, Normal Helly circular-arc graphs and its subclasses, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, Some results on the target set selection problem, Non-preemptive scheduling in a smart grid model and its implications on machine minimization, A fully dynamic graph algorithm for recognizing interval graphs, The vertex leafage of chordal graphs, On Robinsonian dissimilarities, the consecutive ones property and latent variable models, Computing a minimum outer-connected dominating set for the class of chordal graphs, A linear time algorithm for liar's domination problem in proper interval graphs, Global total \(k\)-domination: approximation and hardness results, A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs, Moplex orderings generated by the LexDFs algorithm, Subset feedback vertex sets in chordal graphs, \(b\)-vectors of chordal graphs, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, On the correspondence between tree representations of chordal and dually chordal graphs, Characterization of classical graph classes by weighted clique graphs, On the chromatic polynomial and counting DP-colorings of graphs, An efficient representation of chordal graphs, Graph isomorphism and identification matrices: Sequential algorithms, Searching for better fill-in, Toll convexity, Hardness results, approximation and exact algorithms for liar's domination problem in graphs, A conjunctive parallelogram model for Pick any/\(n\) data, On partial Grundy coloring of bipartite graphs and chordal graphs, Joint density of correlations in the correlation matrix with chordal sparsity patterns, Convex \((0, 1)\)-matrices and their epitopes, Exact solution algorithms for the maximum flow problem with additional conflict constraints, Characterization of the graphs with boxicity \(\leq 2\), Cluster deletion on interval graphs and split related graphs, Forbidden subgraphs of power graphs, Paired threshold graphs, A characterization of graphs with interval two-step graphs, Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results, Duality pairs and homomorphisms to oriented and unoriented cycles, Double vertex-edge domination in graphs: complexity and algorithms, Ambush cops and robbers, Recognition of some perfectly orderable graph classes, Maximizing the number of jobs scheduled at their baseline starting times in case of machine failures, Colouring exact distance graphs of chordal graphs, An extension of a theorem of Fulkerson and Gross, Avoidable vertices and edges in graphs: existence, characterization, and applications, On the semi-perfect elimination, Attachment centrality: measure for connectivity in networks, A good submatrix is hard to find, Bayesian networks: the minimal triangulations of a graph, A hybrid adjacency and time-based data structure for analysis of temporal networks, Set characterizations and convex extensions for geometric convex-hull proofs, A survey of statistical problems in archaeological dating, A characterisation of rigid circuit graphs, Petrie symmetric functions, A note on the consecutive ones submatrix problem., Obtaining matrices with the consecutive ones property by row deletions, Extending partial representations of subclasses of chordal graphs, A note on uncountable chordal graphs, Polynomial-time local-improvement algorithm for consecutive block minimization, Minimising the number of gap-zeros in binary matrices, Cyclic arrangements with minimum modulo \(m\) winding numbers, New limits of treewidth-based tractability in optimization, The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs, Maximum Semiorders in Interval Orders, Extremal Values of the Interval Number of a Graph, D-optimal statistical designs with restricted string property, Lexbfs-orderings and powers of hhd-free graphs∗, Isomorphism Testing in Hookup Classes, COMPLEXITY OF CERTAIN FUNCTIONAL VARIANTS OF TOTAL DOMINATION IN CHORDAL BIPARTITE GRAPHS, Proximity Search for Maximal Subgraph Enumeration, Computing the clique-separator graph for an interval graph in linear time, Polynomial removal lemmas for ordered graphs, Characterizing directed path graphs by forbidden asteroids, Reconfiguration of colorable sets in classes of perfect graphs, Model Rejection and Parameter Reduction via Time Series, Testing superperfection of k-trees, Matrices with chordal inverse zero-patterns, Convex Relaxations for Permutation Problems, Covering the edges with consecutive sets, Edge erasures and chordal graphs, Approximation Algorithms for Not Necessarily Disjoint Clustered TSP, SCHEDULING INTERVAL ORDERS IN PARALLEL, Algorithmic Aspects of Disjunctive Domination in Graphs, Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence, On dominating set polyhedra of circular interval graphs, On double and multiple interval graphs, Consecutive cuts and paths, and bounds on k‐terminal reliability, Heuristic methods to consecutive block minimization, Efficient algorithms for computing the reliability of permutation and interval graphs, Graph Bisection with Pareto Optimization, Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number, Minimal Obstructions for Partial Representations of Interval Graphs, An efficient algorithm for counting Markov equivalent DAGs, Jet graphs, Iterated local search for consecutive block minimization, Asymptotic enumeration of full graphs, Objective Bayesian Nets for Integrating Consistent Datasets, Contraction Blockers for Graphs with Forbidden Induced Paths, Minimum Average Distance Clique Trees, On the computational complexity of ordered subgraph recognition, Determinantal formulae and nonsymmetric gaussian perfect elimination, Computing partial hypergraphs of bounded width, Edgewise strongly shellable clutters, On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints, Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs, Unnamed Item, Unnamed Item, Reconfiguration of cliques in a graph, The Greedy Algorithm and the Cohen-Macaulay Property of Rings, Graphs and Toric Projective Curves, Parameters Tied to Treewidth, Algorithms on circular-arc graphs, Threshold tolerance graphs, Enumeration of Full Graphs: Onset of the Asymptotic Region, Unnamed Item, On the tree representation of chordal graphs, On the Golod property of Stanley-Reisner rings, Extracting constrained 2-interval subsets in 2-interval sets, Computing Role Assignments of Proper Interval Graphs in Polynomial Time, LP Formulations for Polynomial Optimization Problems, Dual parameterization of Weighted Coloring, A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row, OptimalI-Intersection assignments for graphs: A linear programming approach, I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications, Graphbots: Mobility in discrete spaces, Interval digraphs: An analogue of interval graphs, A REVIEW OF TREE CONVEX SETS TEST, Tree decomposition and discrete optimization problems: a survey, On the Iterated Biclique Operator, A matrix characterization of interval and proper interval graphs, Hypergraphs and intervals, A Separator Theorem for Chordal Graphs, On a certain numbering of the vertices of a hypergraph, Representation characterizations of chordal bipartite graphs, Algorithmic approach to the consecutive retrieval property, Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results, On the dominator coloring in proper interval graphs and block graphs, Unnamed Item, From Path Graphs to Directed Path Graphs, The homotopy types of moment-angle complexes for flag complexes, A characterization of 2-tree probe interval graphs, Extremal interval graphs, -constructibility of planar graphs, -constructibility of planar graphs, Intransitive indifference with unequal indifference intervals, Complexity of approximating the oriented diameter of chordal graphs, On nontransitive indifference, A structure theorem for the consecutive 1's property, Triangulated graphs and the elimination process, Betweenness, orders and interval graphs, Description of some relations on the set of real-line intervals, Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid, On the theory of the consecutive storage of relevant records, Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs, On some simplicial elimination schemes for chordal graphs, The Interval Count of a Graph, The intersection graphs of subtrees in trees are exactly the chordal graphs, Oracles for vertex elimination orderings, Finding a Maximum-Weight Convex Set in a Chordal Graph, On an edge partition and root graphs of some classes of line graphs, An Optimal Algorithm for Strict Circular Seriation, Fast Diameter Computation within Split Graphs, The bandwidth problem for graphs and matrices—a survey, A rounding algorithm for integer programs, A generalized insertion algorithm for the seriation problem, Periodic assignment and graph colouring, Algorithmic characterizations of interval orderd hypergraphs and applications, Long paths and toughness of \(k\)-trees and chordal planar graphs, Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\), Compatibility between interval structures and partial orderings, The generating polynomial and Euler characteristic of intersection graphs, Finding minimum height elimination trees for interval graphs in polynomial time, Clique tree generalization and new subclasses of chordal graphs, New linear time algorithms for generating perfect elimination orderings of chordal graphs, Testing for class membership in multi-parent hierarchies, Fuzzy intersection graphs, Proper interval graphs and the guard problem, Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs, Maximal chordal subgraphs, A class of lattices with Möbius function \(\pm 1,0\), Graph extremities defined by search algorithms, Computing a clique tree with the algorithm maximal label search, Simplicial decompositions of graphs: A survey of applications, Algorithmic aspects of intersection graphs and representation hypergraphs, On properties of unit interval graphs with a perceptual motivation, Subspaces with well-scaled frames, Recognition of Robinsonian dissimilarities, Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs, Unit disk graph recognition is NP-hard, Satisfiability problems on intervals and unit intervals, On the \(b\)-continuity of the lexicographic product of graphs, Separability generalizes Dirac's theorem, Matching and multidimensional matching in chordal and strongly chordal graphs, Recoloring graphs via tree decompositions, PC trees and circular-ones arrangements., 2-role assignments on triangulated graphs., Extremal values of the interval number of a graph. II, Extremal values of the interval number of a graph, II, On minimal augmentation of a graph to obtain an interval graph, Complexity of representation of graphs by set systems, The complexity of secure domination problem in graphs, Arankings of trees, Recovering trees from well-separated multi-state characters., Inheritance principles for chordal graphs, Representations of graphs and networks (coding, layouts and embeddings), Some aspects of the semi-perfect elimination, Classes of bipartite graphs related to chordal graphs, An inertia formula for Hermitian matrices with sparse inverses, On the classes of interval graphs of limited nesting and count of lengths, Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements, Norbert Wiener on the theory of measurement (1914, 1915, 1921), Complexity of distance paired-domination problem in graphs, Hardness results on the gapped consecutive-ones property problem, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Optimal multiple interval assignments in frequency assignment and traffic phasing, Studies on hypergraphs. I: Hyperforests, Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, Efficient parallel recognition of some circular arc graphs. I, An algorithm for testing chordality of graphs, A recognition algorithm for the intersection graphs of directed paths in directed trees, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, Contraction and deletion blockers for perfect graphs and \(H\)-free graphs, Totally unimodular multistage stochastic programs, The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure, Partition of a query set into minimal number of subsets having consecutive retrieval property, A Lex-BFS-based recognition algorithm for Robinsonian matrices, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Interval \(k\)-graphs and orders, Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach, A note on perfect Gaussian elimination, Recognizing edge clique graphs among interval graphs and probe interval graphs, Trivially perfect graphs, The circular dimension of a graph, The seriation problem and the travelling salesman problem, Preemptive scheduling and antichain polyhedra, A recognition algorithm for the intersection graphs of paths in trees, The neighbour-scattering number can be computed in polynomial time for interval graphs, Counting clique trees and computing perfect elimination schemes in parallel, A linear time recognition algorithm for proper interval graphs, Induced matchings, Phylogeny numbers, Optimal circular arc representations: Properties, recognition, and construction, An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs, The clique-separator graph for chordal graphs, A characterization of cycle-free unit probe interval graphs, Combinatorial optimization models for production scheduling in automated manufacturing systems, Minimal vertex separators of chordal graphs, On probe interval graphs, On the consecutive ones property, A generic disjunctive/conjunctive decomposition model for \(n\)-ary relations, A selected tour of the theory of identification matrices, Estimating high-dimensional intervention effects from observational data, On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results, The forbidden subgraph characterization of directed vertex graphs, Some remarks on interval graphs, Properties of (0,1)-matrices with no triangles, Matrix sandwich problems, List \(T\)-colorings of graphs, Decomposition by clique separators, Asymptotically optimal weighing designs with string property, Higher homotopy groups of complements of complex hyperplane arrangements, The square of a chordal graph, Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
