scientific article
From MaRDI portal
Publication:3898496
zbMath0452.05001MaRDI QIDQ3898496
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
treeconnectednessintersection graphdominationgraphs and matricesboxicitycolouring independenceeulerian path
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Eulerian and Hamiltonian graphs (05C45)
Related Items (78)
Extremal Values of the Interval Number of a Graph ⋮ The \(k\)-fractal of a simplicial complex ⋮ Inverting Signed Graphs ⋮ Optimal greedy algorithms for indifference graphs ⋮ Competition hypergraphs ⋮ Structural Analysis of Directed Signed Networks ⋮ Stability for coupled systems on networks with Caputo-Hadamard fractional derivative ⋮ Deferred-query—An efficient approach for problems on interval and circular-arc graphs ⋮ Asymptotic distributions in random graphs with applications to social networks ⋮ Niche space, multigraphs, and the Helly condition ⋮ The independent transversal dombondage number of a graph ⋮ Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs ⋮ Stationary states and spatial patterning in the cellular automaton \textit{SEIS} epidemiology model ⋮ On the domatic number of interval graphs ⋮ Faster approximation for maximum independent set on unit disk graph ⋮ Gridline indifference graphs ⋮ A simple linear-time algorithm for computing the center of an interval graph ⋮ An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs ⋮ Selection of programme slots of television channels for giving advertisement: a graph theoretic approach ⋮ Algorithms for interval structures with applications ⋮ Block edit models for approximate string matching ⋮ Model and methods to address urban road network problems with disruptions ⋮ The strong network orientation problem ⋮ 2-role assignments on triangulated graphs. ⋮ Linear-time recognition of Helly circular-arc models and graphs ⋮ The conditional covering problem on unweighted interval graphs with nonuniform coverage radius ⋮ Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph ⋮ Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ An optimal greedy heuristic to color interval graphs ⋮ A sequential algorithm for finding a maximum weightK-independent set on interval graphs ⋮ The bondage number of a graph ⋮ \((i,j)\) competition graphs ⋮ On upper bound graphs with respect to operations on graphs ⋮ Algorithms for Interval Structures with Applications ⋮ Simple linear time recognition of unit interval graphs ⋮ A linear time algorithm to compute a dominating path in an AT-free graph ⋮ A graph with the partial order competition dimension greater than five ⋮ Methods for solving road network problems with disruptions ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model ⋮ Recognizing Proper Tree-Graphs ⋮ An efficient algorithm for finding a maximum weight 2-independent set on interval graphs ⋮ Minimal comparability completions of arbitrary graphs ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Total domination in interval graphs ⋮ Tree decomposition and discrete optimization problems: a survey ⋮ A remark on eigen values of signed graph ⋮ Foundations of a connectivity theory for simplicial complexes ⋮ A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs ⋮ Some applications of graph theory to other parts of mathematics. ⋮ The elimination procedure for the competition number is not optimal ⋮ The competition number of a graph whose holes do not overlap much ⋮ Roughness in Cayley graphs ⋮ A Lex-BFS-based recognition algorithm for Robinsonian matrices ⋮ Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent ⋮ Some approximation algorithms for the clique partition problem in weighted interval graphs ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ On \(H\)-topological intersection graphs ⋮ Mutual exclusion scheduling with interval graphs or related classes. I ⋮ A linear time recognition algorithm for proper interval graphs ⋮ Phylogeny numbers ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited ⋮ Phylogeny numbers for graphs with two triangles ⋮ Spectra of signed graphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey ⋮ Lexicographic Orientation Algorithms ⋮ Double Semiorders and Double Indifference Graphs ⋮ Linear game non-contextuality and Bell inequalities—a graph-theoretic approach ⋮ A characterization of graphs of competition number m ⋮ Chronological orderings of interval graphs ⋮ The competition number of a graph having exactly one hole ⋮ Inverting graphs of rectangular matrices ⋮ Capacitated domination: problem complexity and approximation algorithms ⋮ The relationship between the threshold dimension of split graphs and various dimensional parameters ⋮ Chronological Orderings of Interval Digraph ⋮ A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
This page was built for publication:
