scientific article; zbMATH DE number 3632548
From MaRDI portal
Publication:4193514
zbMath0407.05071MaRDI QIDQ4193514
Peter L. Hammer, Stephane Foldes
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The Hamiltonian properties in \(K_{1,r}\)-free split graphs, A polynomial time algorithm for geodetic hull number for complementary prisms, One-three join: a graph operation and its consequences, Word-representability of split graphs generated by morphisms, Forbidden subgraphs in reduced power graphs of finite groups, Letter Graphs and Geometric Grid Classes of Permutations, Finding good 2-partitions of digraphs. II. Enumerable properties, Labelled well-quasi-order for permutation classes, On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs, Mycielskian of graphs with small game domination number, Matrix partitions of split graphs, Note on maximal split-stable subgraphs, Pairwise Compatibility Graphs: A Survey, 2-nested matrices: towards understanding the structure of circle graphs, Injective hulls of various graph classes, Unnamed Item, Counting Small Induced Subgraphs Satisfying Monotone Properties, Representing split graphs by words, Parameterized complexity of graph burning, The one-dimensional Euclidean domain: finitely many obstructions are not enough, Algorithms for deletion problems on split graphs, Graph classes with linear Ramsey numbers, Partitions of graphs into one or two independent sets and cliques, Good characterizations and linear time recognition for 2-probe block graphs, A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function, Steiner trees for hereditary graph classes: a treewidth perspective, Minimal asymmetric graphs, Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}, On graphs with a single large Laplacian eigenvalue, Bounding the Clique-Width of H-free Chordal Graphs, Minimal obstructions to 2-polar cographs, Contraction Blockers for Graphs with Forbidden Induced Paths, Minimal obstructions to \(( s , 1 )\)-polarity in cographs, Note on generalized Cayley graph of finite rings and its complement, Degree-constrained 2-partitions of graphs, Unnamed Item, Near-domination in graphs, Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case, Clique-Width for Graph Classes Closed under Complementation, Unnamed Item, Counting and enumerating unlabeled split–indifference graphs, Unnamed Item, Forbidden graphs for classes of split-like graphs, On the complexity of the black-and-white coloring problem on some classes of perfect graphs, Computing square roots of trivially perfect and threshold graphs, \([1,2\)-sets in graphs], Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs, THE DOMINATION GAME ON SPLIT GRAPHS, Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs, Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs, Well-indumatched Trees and Graphs of Bounded Girth, Antimatroids and balanced pairs, NP-hard graph problems and boundary classes of graphs, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, Simple groups whose Gruenberg-Kegel graph or solvable graph is split, Line zero divisor graphs, Some properties of various graphs associated with finite groups, The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem, Optimal backbone coloring of split graphs with matching backbones, On the interval completion of chordal graphs, Split permutation graphs, Groups for which the noncommuting graph is a split graph, Unnamed Item, Recognition of Unigraphs through Superposition of Graphs (Extended Abstract), Minimal obstructions to \(( \infty , k )\)-polarity in cographs, Graph partitions with prescribed patterns, Graphs without five-vertex path and four-vertex cycle, Cluster deletion on interval graphs and split related graphs, Characterizing and recognizing probe block graphs, Join colourings of chordal graphs, Half-graphs, other non-stable degree sequences, and the switch Markov chain, Edge vulnerability parameters of bisplit graphs, Unnamed Item, Solving Partition Problems Almost Always Requires Pushing Many Vertices Around, Linear separation of connected dominating sets in graphs, Spanning trees with disjoint dominating and 2-dominating sets, On projective intersection graph of ideals of commutative rings, Vulnerability of super connected split graphs and bisplit graphs, The principal Erdős-Gallai differences of a degree sequence, Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs, Unnamed Item, Bisplit graphs, Packing of (0, 1)-matrices, Some of My Favorite Coloring Problems for Graphs and Digraphs, Graph Classes and Forbidden Patterns on Three Vertices, The structure of graphs with forbidden induced $C_4$, $\overline{C}_4$, $C_5$, $S_3$, chair and co-chair, Forbidden subgraphs in generating graphs of finite groups, Complement of the generalized total graph of fields, Recent developments on the power graph of finite groups – a survey, Covering Graphs by Colored Stable Sets, P-antiregular graphs, On upper bound graphs with forbidden subposets, Matrix Partitions with Finitely Many Obstructions, On maximum independent set of categorical product and ultimate categorical ratios of graphs, Faster parameterized algorithms for deletion to split graphs, Upward-closed hereditary families in the dominance order, Knocking out \(P_k\)-free graphs, On the chromatic number of the power graph of a finite group, Maximally and super connected multisplit graphs and digraphs, Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs, Satgraphs and independent domination. I, Split graphs, Independent sets of maximum weight in (\(p,q\))-colorable graphs., Boundary classes of graphs for the dominating set problem, Linear recognition of pseudo-split graphs, About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs, On realization graphs of degree sequences, Groups that have a partition by commuting subsets, Computing role assignments of split graphs, Finding good 2-partitions of digraphs. I. Hereditary properties, Absolute retracts of split graphs, The bipartite-splittance of a bipartite graph, Clique cycle-transversals in distance-hereditary graphs, Mock threshold graphs, Red-blue clique partitions and \((1-1)\)-transversals, A unified approach to recognize squares of split graphs, Constant-time parallel recognition of split graphs, \(P_{4}\)-laden graphs: A new class of brittle graphs, Coloring perfect degenerate graphs, The \(S\)-\textsc{labeling} problem: an algorithmic tour, On graphs without \(P_ 5\) and \(\overline {P}_ 5\), On the use of Boolean methods for the computation of the stability number, Minimum edge ranking spanning trees of split graphs, Polar graphs and maximal independent sets, Star coloring of graphs with girth at least five, Space graphs and sphericity, Algorithmic aspects of the generalized clique-transversal problem on chordal graphs, Universal \(H\)-colourable graphs, Some topics in cochromatic theory, Recognizing line-polar bipartite graphs in time \(O(n)\), The hardness of approximating the boxicity, cubicity and threshold dimension of a graph, Characterizing and edge-colouring split-indifference graphs, Obstructions to partitions of chordal graphs, Extending the Gyárfás-Sumner conjecture, Excluding pairs of graphs, A decidability result for the dominating set problem, On variations of \(P_{4}\)-sparse graphs, On the Colin de Verdière number of graphs, Star coloring of certain graph classes, On the structure and stability number of \(P_{5}\)- and co-chair-free graphs, On the forbidden induced subgraph sandwich problem, Split orders, Clique-width of partner-limited graphs, Colouring, constraint satisfaction, and complexity, The splittance of a graph, Almost nonpreemptive schedules, Some properties of edge intersection graphs of single-bend paths on a grid, Representations of graphs and networks (coding, layouts and embeddings), Induced saturation of graphs, Classes of bipartite graphs related to chordal graphs, Classifying \(k\)-edge colouring for \(H\)-free graphs, Complexity of the cluster deletion problem on subclasses of chordal graphs, The Dilworth number of auto-chordal bipartite graphs, Strict chordal and strict split digraphs, Progress on the description of identifying code polyhedra for some families of split graphs, On the SPANNING \(k\)-TREE problem, A counterexample regarding labelled well-quasi-ordering, Operator decomposition of graphs and the reconstruction conjecture, On the Grundy number of graphs with few \(P_4\)'s, Towards a comprehensive theory of conflict-tolerance graphs, Minimal split completions, Recent developments on graphs of bounded clique-width, Decomposing complete edge-chromatic graphs and hypergraphs. Revisited, A forbidden subgraph characterization of line-polar bipartite graphs, Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs, Maximum independent sets in subclasses of \(P_{5}\)-free graphs, On distance two graphs of upper bound graphs, Rainbow graph splitting, Contraction and deletion blockers for perfect graphs and \(H\)-free graphs, On the complete width and edge clique cover problems, Computing the boxicity of a graph by covering its complement by cointerval graphs, Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions, Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs, The price of connectivity for cycle transversals, A note on Hamiltonian split graphs, Algorithms for unipolar and generalized split graphs, Parameterized complexity of vertex colouring, Extension of hereditary classes with substitutions, Cubicity, boxicity, and vertex cover, Note on upper bound graphs and forbidden subposets, An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs, Dynamically maintaining split graphs, The clique-separator graph for chordal graphs, On forcibly hereditary P-graphical sequences, Split digraphs, Containment relations in split graphs, Hardness of edge-modification problems, Bichromatic \(P_{4}\)-composition schemes for perfect orderability, Partitioning chordal graphs into independent sets and cliques, Edge search in graphs with restricted test sets, Stability in \(P_5\)- and banner-free graphs, Characterisation of self-complementary chordal graphs, Split and balanced colorings of complete graphs, Enumerative aspects of certain subclasses of perfect graphs, Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time., Degree sequences of matrogenic graphs, Once more on matrogenic graphs, On the pathwidth of chordal graphs, A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs, Packing \(r\)-cliques in weighted chordal graphs, On the linear strand of edge ideals of some zero-divisor graphs, On Hamiltonian properties of \(K_{1, r}\)-free split graphs, The overfull conjecture on split-comparability and split-interval graphs, Broadcasting in split graphs, Certifying induced subgraphs in large graphs, Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs, Unnamed Item, Exact algorithms for restricted subset feedback vertex set in chordal and split graphs, Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes, Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs, Chain graph sequences and Laplacian spectra of chain graphs, Split graphs and block representations, Bounding the clique-width of \(H\)-free split graphs, Quadratic vertex kernel for split vertex deletion, Dominating cliques in graphs, Parameterized Complexity of Graph Burning, Dominating cliques in graphs, Deciding the Bell Number for Hereditary Graph Properties, Bounding the clique-width of \(H\)-free split graphs, Disjoint paths and connected subgraphs for \(H\)-free graphs, Disjoint paths and connected subgraphs for \(H\)-free graphs, Computing subset transversals in \(H\)-free graphs, On efficient domination for some classes of \(H\)-free chordal graphs, A note on subspace sum graph of vector spaces
