scientific article; zbMATH DE number 3503283
From MaRDI portal
Publication:4083461
zbMath0322.05114MaRDI QIDQ4083461
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A density bound for triangle‐free 4‐critical graphs, Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration, Maximum rectilinear crossing number of uniform hypergraphs, Directed Steiner tree packing and directed tree connectivity, Coloring directed hypergraphs, Some Cubic Time Regularity Algorithms for Triple Systems, Near optimal colourability on hereditary graph families, The complexity of \(L(p, q)\)-edge-labelling, Colouring graphs of bounded diameter in the absence of small cycles, The set splittability problem, Even cycles in directed graphs, Billiard quorums on the grid, Coloring problems on bipartite graphs of small diameter, Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat}, Plurigraph coloring and scheduling problems, Trees, paths, stars, caterpillars and spiders, Constructing SAT Filters with a Quantum Annealer, From the quantum approximate optimization algorithm to a quantum alternating operator ansatz, Finding shortest paths between graph colourings, On generalizations of separating and splitting families, Load balancing in quorum systems, Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3, Approximability of maximum splitting of k-sets and some other Apx-complete problems, Induced Separation Dimension, On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs, Computational complexity of terminological reasoning in BACK, Trees, Paths, Stars, Caterpillars and Spiders, Two-coloring triples such that in each color class every element is missed at least once, Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter, Coloring the cliques of line graphs, Colouring diamond-free graphs, On packing time-respecting arborescences, A note on two-colorability of nonuniform hypergraphs, Analogues of cliques for \((m,n)\)-colored mixed graphs, The complexity of generalized graph colorings, Color-bounded hypergraphs. VI: Structural and functional jumps in complexity, Colouring square-free graphs without long induced paths., Colouring \((P_r + P_s)\)-free graphs, Equitable coloring of hypergraphs, Independent feedback vertex sets for graphs of bounded diameter, On stable cutsets in line graphs, Unnamed Item, Unnamed Item, Packing strong subgraph in digraphs, Unnamed Item, Access balancing in storage systems by labeling partial Steiner systems, A priori TSP in the Scenario Model, On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs, Colorability of mixed hypergraphs and their chromatic inversions, Crumbling walls: a class of practical and efficient quorum systems, A note on line digraphs and the directed max-cut problem, Critical vertices and edges in \(H\)-free graphs, Graph properties and hypergraph colourings, The envy-free matching problem with pairwise preferences, List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective, Independent feedback vertex set for \(P_5\)-free graphs, Computational aspects of monotone dualization: a brief survey, Edge Contractions in Subclasses of Chordal Graphs, The availability of crumbling wall quorum systems, Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs, Grassmann homomorphism and Hajós-type theorems, On the complexity of colouring by superdigraphs of bipartite graphs, Inclusion/exclusion meets measure and conquer, The computational complexity of the parallel knock-out problem, Colouring Steiner quadruple systems, On the complexity of recognizing directed path families, On-line algorithms for 2-coloring hypergraphs via chip games, Islands in Graphs on Surfaces, Testing hypergraph colorability, Bipartite bihypergraphs: a survey and new results, An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance, Partition the vertices of a graph into one independent set and one acyclic set, Unnamed Item, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree, Partitioning the vertices of a cubic graph into two total dominating sets, \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum, Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization, 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs, Orderings of uniquely colorable hypergraphs, NP-completeness results for partitioning a graph into total dominating sets, A priori TSP in the scenario model, Unnamed Item, Edge vulnerability parameters of bisplit graphs, Colouring graphs of bounded diameter in the absence of small cycles, On the fractional chromatic number of monotone self-dual Boolean functions, On list \(k\)-coloring convex bipartite graphs, Average probe complexity in quorum systems, Hard problems that quickly become very easy, Colouring (P_r+P_s)-Free Graphs, Colouring H-free graphs of bounded diameter., An algebraic point of view of the data structures of database systems, The complexity of some problems related to GRAPH 3-COLORABILITY, Colouring square-free graphs without long induced paths, 1-2-3 Conjecture in digraphs: more results and directions, Planar graphs without short even cycles are near-bipartite, Planar quorums, Recognizing Graphs Close to Bipartite Graphs, Role coloring bipartite graphs, Square critically 3-chromatic hypergraphs, Hypergraph cuts above the average, Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees, Bisplit graphs, An expected polynomial time algorithm for coloring 2-colorable 3-graphs, DP-degree colorable hypergraphs, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Parameterized Pre-Coloring Extension and List Coloring Problems, Signsolvability revisited, Domination, coloring and stability in \(P_5\)-reducible graphs, Quorum systems constructed from combinatorial designs
