scientific article; zbMATH DE number 2203240

Publication date: 6 September 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

Analyzing the maritime transportation system in Greece: a complex network approach, Complexity and monotonicity results for domination games, On the ensemble of optimal identifying codes in a twin-free graph, Structural tractability of counting of solutions to conjunctive queries, On spectra of spectra, An edge variant of the Erdős-Pósa property, Classifying coloring graphs, On decomposing graphs of large minimum degree into locally irregular subgraphs, Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs, A topological classification of convex bodies, A network-based feature selection approach to identify metabolic signatures in disease, Efficient search and responsiveness trade-offs in a Markov chain model of evolution in dynamic environments, Approximating the maximum multiple RNA interaction problem, On the spectral gap of a quantum graph, On the OBDD representation of some graph classes, Graph odometry, Bounded face-width forces $K_7$-minors in orientable surfaces, New classes of graceful unicyclic graphs, Total graph interpretation of the numbers of the Fibonacci type, Extremal trees with respect to number of $(A, B, 2 C)$-edge colourings, Planar disjoint-paths completion, Strong isoperimetric inequalities and combinatorial curvatures on multiply connected planar graphs, The dynamics of the forest graph operator, Decomposing oriented graphs into six locally irregular oriented graphs, Pursuit evasion on infinite graphs, Graph editing to a fixed target, Average case polyhedral complexity of the maximum stable set problem, Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees, Some results on weighted graphs without induced cycles of nonpositive weights, Parameterized complexity of $k$-anonymity: hardness and tractability, Metrization of weighted graphs, Every 3-connected $\{K_{1,3},N_{3,3,3}\}$-free graph is Hamiltonian, Uniform hyperbolicity of the graphs of curves, Lassoing and corralling rooted phylogenetic trees, Recovering quantum graphs from their Bloch spectrum, Pfaffian graphs embedding on the torus, A graph-based approach for the approximate solution of the chemical master equation, Forbidden subgraphs generating a finite set, Circumferences of 2-factors in claw-free graphs, Increasing the minimum degree of a graph by contractions, On automorphisms of the countable p.e.c. graph, Distributed strategies for generating weight-balanced and doubly stochastic digraphs, $l_1$-embeddability under the edge-gluing operation on graphs, Parabolic theory of the discrete $p$-Laplace operator, Colouring of graphs with Ramsey-type forbidden subgraphs, Graphs with equal chromatic symmetric functions, Multiswapped networks and their topological and algorithmic properties, Optimal cuts and partitions in tree metrics in polynomial time, Delay colourings of cubic graphs, Graph classes and Ramsey numbers, Independence densities of hypergraphs, Recent advances in unfolding technique, Online Ramsey theory for planar graphs, Hamiltonian cycles with all small even chords, On the uncontrollability of nonabelian group codes with uncoded group $\mathbb Z_p$, Nested hierarchies in planar graphs, Nowhere-zero flows in Cartesian bundles of graphs, Hamilton cycles in 5-connected line graphs, Brooks' theorem for generalized dart graphs, Graphs of separability at most 2, On the model-checking of monadic second-order formulas with edge set quantifications, Minimum rank of outerplanar graphs, On Ladner's result for a class of real machines with restricted use of constants, A short proof of the tree-packing theorem, A characterization of 1-cycle resonant graphs among bipartite 2-connected plane graphs, On generalized Fibonacci numbers and $k$-distance $K_p$-matchings in graphs, Eigenvalues of certain weighted graphs joined at their roots having cliques at some levels, A Dirac theorem for trestles, On claw-free $t$-perfect graphs, Circuits of length 5 in 2-factors of cubic graphs, Embedding a mesh of trees in the crossed cube, Catalan structures and dynamic programming in $H$-minor-free graphs, \textsc{max-cut} and containment relations in graphs, On the reconstruction of planar lattice-convex sets from the covariogram, Flows and parity subgraphs of graphs with large odd-edge-connectivity, The dag-width of directed graphs, On the approximability of some degree-constrained subgraph problems, Well-quasi-ordering of matrices under Schur complement and applications to directed graphs, UPS delivers optimal phase diagram in high-dimensional variable selection, Antimagic labeling graphs with a regular dominating subgraph, The saga of minimum spanning trees, The inverse 1-median problem on tree networks with variable real edge lengths, Nowhere-zero 3-flows and modulo $k$-orientations, Is the five-flow conjecture almost false?, Eulerian digraphs and toric Calabi-Yau varieties, Kauffman's clock lattice as a graph of perfect matchings: a formula for its height, Parameterized complexity of three edge contraction problems with degree constraints, Some remarks on the structure of strong $k$-transitive digraphs, A discussion of the favorable factors for the economic system's utility growth rate, On the number of optimal identifying codes in a twin-free graph, The kernelization complexity of connected domination in graphs with (no) small cycles, Spanning 3-ended trees in $k$-connected $K_{1,4}$-free graphs, The Hamiltonicity of generalized honeycomb torus networks, Efficient simulation of Markov chains using segmentation, MAX-plus objects to study the complexity of graphs, Myopic models of population dynamics on infinite networks, Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree, Distance constraint satisfaction problems, Exact solutions for latency-bounded target set selection problem on some special families of graphs, The boundary of a square tiling of a graph coincides with the Poisson boundary, Optimum distance flag codes from spreads via perfect matchings in graphs, CPG graphs: some structural and hardness results, On structural parameterizations of load coloring, A polynomial time algorithm to compute the connected treewidth of a series-parallel graph, The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample, Hardness and approximation of traffic grooming, TDBS: A time division beacon scheduling mechanism for ZigBee cluster-tree wireless sensor networks, Subgraph transversal of graphs, Induced-universal graphs for graphs with bounded maximum degree, Embedding paths and cycles in 3-ary $n$-cubes with faulty nodes and links, Deciding $k$-colorability of $P_5$-free graphs in polynomial time, Coarse differentiation and multi-flows in planar graphs, Structural identifiability in low-rank matrix factorization, An extension of Sallee's theorem to infinite locally finite VAP-free plane graphs, End spaces and spanning trees, Hypergraphs and the Clar problem in hexagonal systems, Cycles and communicating classes in membrane systems and molecular dynamics, On semiextensions and circuit double covers, Some recent progress and applications in graph minor theory, Turán's theorem for pseudo-random graphs, A $(4n - 9)/3$ diagnosis algorithm on $n$-dimensional cube network, Loebl-Komlós-Sós conjecture: dense case, Are there any good digraph width measures?, Fast recoloring of sparse graphs, A new probabilistic constraint logic programming language based on a generalised distribution semantics, Directed elimination games, The journey of the union-closed sets conjecture, Critical exponents of graphs, Further hardness results on rainbow and strong rainbow connectivity, Digraph measures: Kelly decompositions, games, and orderings, Linked graphs with restricted lengths, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, End spaces of graphs are normal, Nonrepetitive colorings of graphs of bounded tree-width, Trees with extremal numbers of maximal independent sets including the set of leaves, Generalizations of Abel's and Hurwitz's identities, Computing knot Floer homology in cyclic branched covers, A weaker version of Lovász' path removal conjecture, Connected but not path-connected subspaces of infinite graphs, Proof of the bandwidth conjecture of Bollobás and Komlós, A graph-theoretic approach to a partial order of knots and links, Every minor-closed property of sparse graphs is testable, A self-stabilizing algorithm for cut problems in synchronous networks, Discovery of network properties with all-shortest-paths queries, Rank functions on rooted tree quivers., Vertex-coloring edge-weightings: towards the 1-2-3-conjecture, Normality of cut polytopes of graphs is a minor closed property, Partitions versus sets: a case of duality, Ramsey numbers of long cycles versus books or wheels, The edge-flipping group of a graph, The Clar formulas of a benzenoid system and the resonance graph, Complete catalogue of graphs of maximum degree 3 and defect at most 4, On cover-structure graphs, Most balanced minimum cuts, On Barnette's conjecture, Abstract Arrowian aggregation, A new characterization of $P_{6}$-free graphs, Dynamic programming and planarity: improved tree-decomposition based algorithms, On induced-universal graphs for the class of bounded-degree graphs, Embedding a family of disjoint multi-dimensional meshes into a crossed cube, On graphs isomorphic to their neighbour and non-neighbour sets, Satisfactory graph partition, variants, and generalizations, Homomorphism preservation on quasi-wide classes, Independence complexes of chordal graphs, $H$-coloring tori, Disjoint cycles intersecting a set of vertices, Dense and sparse graph partition, A characterization of the locally finite networks admitting non-constant harmonic functions of finite energy, A note on graph minors and strong products, Dynamic parameterized problems, Centralizers of full injective transformations in the symmetric inverse semigroup, Swap equilibria under link and vertex destruction, On the computational complexity of vertex integrity and component order connectivity, A colored graph approach to perfect phylogeny with persistent characters, Infinite highly connected planar graphs of large girth, Directed width parameters and circumference of digraphs, An algorithmic approach to finding factorial designs with generalized minimum aberration, Bicycles and left-right tours in locally finite graphs, Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups, Transforming a graph into a 1-balanced graph, Graph structural properties of non-Yutsis graphs allowing fast recognition, Mutual exclusion scheduling with interval graphs or related classes. I, Cardinality of relations with applications, The price of connectivity for cycle transversals, Internally 4-connected projective-planar graphs, A variational formulation of constrained dislocation dynamics coupled with heat and vacancy diffusion, Faster approximation schemes and parameterized algorithms on (odd-)$H$-minor-free graphs, Induced packing of odd cycles in planar graphs, Colouring vertices of triangle-free graphs without forests, Clique or hole in claw-free graphs, Bandwidth theorem for random graphs, Maximizing edge-ratio is NP-complete, Three new upper bounds on the chromatic number, On bipartite graphs of defect at most 4, Containment relations in split graphs, Embedding meshes/tori in faulty crossed cubes, Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree, Connectivity of workflow nets: The foundations of stepwise verification, On symmetries of edge and vertex colourings of graphs, On the balanced minimum evolution polytope, Weak similarities of finite ultrametric and semimetric spaces, On dynamic network security: a random decentering algorithm on graphs, Robust dependence modeling for high-dimensional covariance matrices with financial applications, Structure modeling and estimation of multiple resolvable group targets via graph theory and multi-Bernoulli filter, On a class of vertices of the core, Optimizing adiabatic quantum program compilation using a graph-theoretic framework, Countable Menger's theorem with finitary matroid constraints on the ingoing edges, Dynamical systems associated with adjacency matrices, Highly arc-transitive digraphs -- structure and counterexamples, Token graphs, Trees with given stability number and minimum number of stable sets, On the eigenvalues of weighted directed graphs, Cops and Robber game with a fast robber on expander graphs and random graphs, On the complexity of computing MP distance between binary phylogenetic trees, Robust cycle bases do not exist for $K_{n, n}$ if $n \geq 8$, Contractible edges in $k$-connected infinite graphs, Improved FPT algorithms for weighted independent set in bull-free graphs, Recoloring graphs via tree decompositions, Degree sequences and edge connectivity, Fibonacci and telephone numbers in extremal trees, Strong resolving graphs: the realization and the characterization problems, Exact algorithms for finding longest cycles in claw-free graphs, $c$-planarity of embedded cyclic $c$-graphs, Decomposition methods based on articulation vertices for degree-dependent spanning tree problems, On biconnected and fragile subgraphs of low diameter, Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph, Fixing improper colorings of graphs, The Bradley-Terry condition is $L_1$-testable, Induced minor free graphs: isomorphism and clique-width, A connection between sports and matroids: how many teams can we beat?, Towards optimal kernel for connected vertex cover in planar graphs, Exact simultaneous recovery of locations and structure from known orientations and corrupted point correspondences, Dilation coefficient, plane-width, and resolution coefficient of graphs, Expected distance based on random walks, Heat kernel bounds for the Laplacian on metric graphs of polygonal tilings, Multiple multivariate subdivision schemes: matrix and operator approaches, Counting minimal transversals of $\beta$-acyclic hypergraphs, Pfaffian polyominos on the Klein bottle, Deterministically isolating a perfect matching in bipartite planar graphs, Constraint satisfaction with succinctly specified relations, Complete colorings of planar graphs, An axiomatization of the Choquet integral in the context of multiple criteria decision making without any commensurability assumption, Unique (optimal) solutions: complexity results for identifying and locating-dominating codes, Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs, Maximal strongly connected cliques in directed graphs: algorithms and bounds, Generalized acyclic edge colorings via entropy compression, Efficient enumeration of maximal $k$-degenerate induced subgraphs of a chordal graph, The critical exponent: a novel graph invariant, Bi-Laplacians on graphs and networks, Reconfiguration on sparse graphs, An $O(\log \mathrm{OPT})$-approximation for covering and packing minor models of $\theta _r$, On the generalized Wiener polarity index of trees with a given diameter, Absorption probabilities of quantum walks, Clique trees of infinite locally finite chordal graphs, Edge reconstruction of the Ihara zeta function, A Menger-like property of tree-cut width, On chromatic numbers of two extensions of planar graphs, Constructing goal-minimally $k$-diametric graphs by lifts, Fast minor testing in planar graphs, Parameterized complexity of the spanning tree congestion problem, Right-angled Coxeter groups, universal graphs, and Eulerian polynomials, The multiagent planning problem, Approximation of knapsack problems with conflict and forcing graphs, Packing triangles in $K_4$-free graphs, Toroidality of intersection graphs of ideals of commutative rings, Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras, Contraction and deletion blockers for perfect graphs and $H$-free graphs, Planar graphs are $9/2$-colorable, Frozen colourings of bounded degree graphs, MacLane's theorem for arbitrary surfaces, HyPAM: A hybrid continuum-particle model for incompressible free-surface flows, Generalized thrackle drawings of non-bipartite graphs, Minor-embedding in adiabatic quantum computation. I: The parameter setting problem, Operated semigroups, Motzkin paths and rooted trees, Distributed randomized algorithms for probabilistic performance analysis, Harmonic analysis for graph refinements and the continuous graph FFT, Clique numbers of graphs and irreducible exact $m$-covers of the integers, Linear bound on extremal functions of some forbidden patterns in 0-1 matrices, Capacitive flows on a 2D random net, Graph operations characterizing rank-width, Fibonacci numbers and Lucas numbers in graphs, Parallelizing quantum circuits, Spectra of copies of a generalized Bethe tree attached to any graph, Embedding a family of disjoint 3D meshes into a crossed cube, Classifying homeomorphism groups of infinite graphs, Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances, Partitioning graphs into connected parts, A deflection-based bridge diagnosis method, Mixing 3-colourings in bipartite graphs, Removing even crossings on surfaces, Linear time algorithms for finding a dominating set of fixed size in degenerated graphs, Data compression for proof replay, Matchings and independent sets of a fixed size in regular graphs, A note on antisymmetric flows in graphs, Monomial bases for broken circuit complexes, Maximum vertex and face degree of oblique graphs, Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs, A proof of the rooted tree alternative conjecture, Submodular partition functions, A short proof of Fleischner's theorem, Packing Steiner trees on four terminals, Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface, A linear algebraic view of partition regular matrices, Join-irreducible Boolean functions, Rigidity and separation indices of graphs in surfaces, Maxima and minima of the Hosoya index and the Merrifield-Simmons index, Balanced and 1-balanced graph constructions, Compact quotients of non-Archimedean rank-one groups, Affine geometry designs, polarities, and Hamada's conjecture, The Max-Flow Min-Cut theorem for countable networks, Twins of rayless graphs, The fundamental group of a locally finite graph with ends, Compact labelings for efficient first-order model-checking, Two discrete versions of the inscribed square conjecture and some related problems, Worm Monte Carlo study of the honeycomb-lattice loop model, Constant-degree graph expansions that preserve treewidth, Contracting planar graphs to contractions of triangulations, The Bers's constant in genus two, Unprovability threshold for the planar graph minor theorem, Digraph decompositions and monotonicity in digraph searching, On the structure of sets of large doubling, On the sizes of graphs and their powers: the undirected case, Topological minors in bipartite graphs, Local search with edge weighting and configuration checking heuristics for minimum vertex cover, On graphs with few disjoint $t$-star minors, Faster parameterized algorithms for minor containment, Fractional total colourings of graphs of high girth, Linear connectivity forces large complete bipartite minors: an alternative approach, Towards a new framework for domination, Parameterizing cut sets in a graph by the number of their components, The homology of a locally finite graph with ends, Eulerian edge sets in locally finite graphs, Cycle decompositions: from graphs to continua, Clustering dynamics of nonlinear oscillator network: Application to graph coloring problem, Embedding a long fault-free cycle in a crossed cube with more faulty nodes, Spanners in sparse graphs, On the number of unlabeled vertices in edge-friendly labelings of graphs, Minimal classes of graphs of unbounded clique-width, Forbiddance and capacity, Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs, Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence, Explicit and efficient hash families suffice for cuckoo hashing with a stash, A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs, Edge bipartization faster than $2^k$, The expressivity of autosegmental grammars, The degree-diameter problem for sparse graph classes, Finding disjoint paths in split graphs, Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach, On the parameterized complexity of finding separators with non-hereditary properties, Testing outerplanarity of bounded degree graphs, Network topology and equilibrium existence in weighted network congestion games, A 0.5358-approximation for Bandpass-2, Co-2-plex vertex partitions, On the complexity of the flow coloring problem, On the inertia set of a signed tree with loops, On the complexity of computing the $k$-restricted edge-connectivity of a graph, Forbidden directed minors and Kelly-width, Union of distance magic graphs, The worm process for the Ising model is rapidly mixing, Complexity of rainbow vertex connectivity problems for restricted graph classes, On the $H$-force number of Hamiltonian graphs and cycle extendability, Structural properties of recursively partitionable graphs with connectivity 2, A family of $\omega_1$ topological types of locally finite trees, On non-self-referential fragments of modal logics, Near packings of two graphs, \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions, A linear kernel for planar red-blue dominating set, A note on an induced subgraph characterization of domination perfect graphs, A new proof of the flat wall theorem, Networked control design for coalitional schemes using game-theoretic methods, A mathematical model and a metaheuristic approach for a memory allocation problem, The price of anarchy in bilateral network formation in an adversary model, $k$-sum decomposition of strongly unimodular matrices, MSOL restricted contractibility to planar graphs, On the parameterized complexity of reconfiguration problems, Some properties of $k$-Delaunay and $k$-Gabriel graphs, Feasibility analysis of sporadic real-time multiprocessor task systems, Hamiltonian properties of twisted hypercube-like networks with more faulty elements, On a labeling problem in graphs, FPT algorithms for connected feedback vertex set, The problem of singularity for planar grids, Genetic algorithm for combinatorial path planning: the subtour problem, A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment, Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design, Color-critical graphs have logarithmic circumference, Approximation of frame based missing data recovery, Line graph of combinations of generalized Bethe trees: Eigenvalues and energy, On the graph complement conjecture for minimum semidefinite rank, Bases and closures under infinite sums, A decision theory for partially consonant belief functions, On the homology of locally compact spaces with ends, Exact and approximate bandwidth, A fully benzenoid system has a unique maximum cardinality resonant set, Rank-width and tree-width of $H$-minor-free graphs, What is on his mind?, On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs, Connectivity of chamber graphs of buildings and related complexes, An application of rough sets to graph theory, Spectral methods for graph clustering - a survey, Critically paintable, choosable or colorable graphs, Network bipartivity and the transportation efficiency of European passenger airlines, On covers of graphs by Cayley graphs, The planar cubic Cayley graphs of connectivity 2, Using relation-algebraic means and tool support for investigating and computing bipartitions, An external-memory algorithm for string graph construction, Gamma graphs of some special classes of trees, On the edge metric dimension of graphs, A polynomial version of Cereceda's conjecture, Packing tripods: narrowing the density gap, Presentations for vertex-transitive graphs, A coarse graining algorithm based on $m$-order degree in complex network, On 4-connected 4-regular graphs without even cycle decompositions, The minimum degree threshold for perfect graph packings, Diffusion in large networks, A general framework for path convexities, Conflict-free coloring bounds on open neighborhoods, Plethysms of chromatic and Tutte symmetric functions, Vertex partitioning problems on graphs with bounded tree width, A tight bound for conflict-free coloring in terms of distance to cluster, Gallai-Ramsey numbers for rainbow $P_5$ and monochromatic fans or wheels, Input-output $L^2$-well-posedness, regularity and Lyapunov stability of string equations on networks, Approximations of acyclic graphs, On polyhedral graphs and their complements, Reciprocal matrices: properties and approximation by a transitive matrix, On the existence and the number of independent (1,2)-dominating sets in the $G$-join of graphs, Sorting with forbidden intermediates, Binary signed-graphic matroids: representations and recognition algorithms, Bounds on regularity of quadratic monomial ideals, A magic rectangle set on abelian groups and its application, Relational characterisations of paths, Towards degree distribution of a duplication-divergence graph model, Artin group injection in the Hecke algebra for right-angled groups, Recoloring graphs of treewidth 2, On a representation of the automorphism group of a graph in a unimodular group, Group distance magic and antimagic hypercubes, Spanning trees with few peripheral branch vertices, Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction, Multigraded commutative algebra of graph decompositions, Transitivity conditions in infinite graphs, On the complexity of the identifiable subgraph problem, No sublogarithmic-time approximation scheme for bipartite vertex cover, Minimum fill-in of sparse graphs: kernelization and approximation, Ramsey-goodness -- and otherwise, Spectral graph features for the classification of graphs and graph sequences, On the structure of quadrilateral brane tilings, On the inertia set of a signed graph with loops, Pursuing a fast robber on a graph, NP-hardness results for the aggregation of linear orders into median orders, On a new one parameter generalization of Pell numbers, Graph topologies induced by edge lengths, The Zariski topology-graph of modules over commutative rings. II, Fibonacci numbers in graphs with strong (1, 1, 2)-kernels, Equistable graphs, general partition graphs, triangle graphs, and graph products, On graphs of defect at most 2, Manifold topological multi-resolution analysis method, The $t$-latency bounded strong target set selection problem in some kinds of special family of graphs, On the dualization in distributive lattices and related problems, The compared costs of domination location-domination and identification, A Harary-Sachs theorem for hypergraphs, $D$-magic labelings of the folded $n$-cube, Remarks on Barnette's conjecture, The average covering tree value for directed graph games, Finite ultrametric balls, Price of Pareto optimality in hedonic games, A Jordan curve theorem for 2-dimensional tilings, Regular dessins d'enfants with dicyclic group of automorphisms, Towards quantification of incompleteness in the pairwise comparisons methods, Almost complete and equable heteroclinic networks, On some extremal properties of finite ultrametric spaces, Group distance magic Cartesian product of two cycles, On quasisymmetric mappings between ultrametric spaces, Counterexamples to the classical central limit theorem for triplewise independent random variables having a common arbitrary margin, Stochastic resonance in coupled star-networks with power-law heterogeneity, Approximating maximum uniquely restricted matchings in bipartite graphs, Condorcet domains, median graphs and the single-crossing property, How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?, Quantifying sequential subsumption, Distance-transitive digraphs: descendant-homogeneity, property $Z$ and reachability, Role coloring bipartite graphs, Properties and morphisms of finite ultrametric spaces and their representing trees, Introduction to reconfiguration, On the double Roman domination of graphs, On the derivation of weights from incomplete pairwise comparisons matrices via spanning trees with crisp and fuzzy confidence levels, On $k$-distance Pell numbers in 3-edge-coloured graphs, On distance $(r, k)$-Fibonacci numbers and their combinatorial and graph interpretations, Diameter estimates for graph associahedra, Submodular functions and rooted trees, Distributed interactive proofs for the recognition of some geometric intersection graph classes, A Motzkin filter in the Tamari lattice, On the maximum fraction of edges covered by $t$ perfect matchings in a cubic bridgeless graph, Nonorientable genera of Petersen powers, Transitivity on subclasses of bipartite graphs, On the ensemble of optimal dominating and locating-dominating codes in a graph, On decomposing regular graphs into locally irregular subgraphs, A note on divisors of multinomial coefficients, Generalizing cographs to 2-cographs, Characterization of the finite C-MH-homogeneous graphs, Contractible and removable edges in 3-connected infinite graphs, Uniquely derived generalized line graphs and uniquely represented signed graphs with least eigenvalues $\geq -2$, Inductive constructions for frameworks on a two-dimensional fixed torus, Induced disjoint paths in circular-arc graphs in linear time, The $(p, q)$-extremal problem and the fractional chromatic number of Kneser hypergraphs, The Turán number of disjoint copies of paths, Robust equilibria in location games, On group choosability of total graphs, Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity, Detecting induced star-like minors in polynomial time, Harmonious coloring: parameterized algorithms and upper bounds, Moduli spaces of metric graphs of genus 1 with marks on vertices, Characterizing 2-crossing-critical graphs, Matroid representation of clique complexes, Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs, Graph-like continua, augmenting arcs, and Menger's theorem, The rank-width of edge-coloured graphs, Subdivisions in apex graphs, Minimum sizes of identifying codes in graphs differing by one vertex, Vizing's conjecture: A two-thirds bound for claw-free graphs, Packing and covering immersion-expansions of planar sub-cubic graphs, Boundary classes for graph problems involving non-local properties, A polynomial-time algorithm for outerplanar diameter improvement, Recent techniques and results on the Erdős-Pósa property, Signed-graphic matroids with all-graphic cocircuits, Dynamics of global remittances: a graph-based analysis, Breaking graph symmetries by edge colourings, On characterizing the class of cographic signed-graphic matroids, A sequence of algebraic integer relation numbers which converges to 4, Parameterized complexity dichotomy for $(r, \ell)$-\textsc{Vertex Deletion}, Tractability, hardness, and kernelization lower bound for and/or graph solution, Advances in Aharoni-Hartman-Hoffman's conjecture for split digraphs, Graph bases and diagram commutativity, Certifying coloring algorithms for graphs without long induced paths, Modeling the functional network of primary intercellular Ca$^{2+}$ wave propagation in astrocytes and its application to study drug effects, Human dopamine receptors interaction network (DRIN): a systems biology perspective on topology, stability and functionality of the network, On the restricted size Ramsey number involving a path $P_3$, Fast exact algorithms for some connectivity problems parameterized by clique-width, Hereditary properties of finite ultrametric spaces, Partitioning 3-homogeneous Latin bitrades, Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices, Finding induced paths of given parity in claw-free graphs, Obtaining a planar graph by vertex deletion, Counting hexagonal patches and independent sets in circle graphs, On Hamiltonicity of \{claw, net\}-free graphs, Spanning trees with few peripheral branch vertices in a connected claw-free graph, The concentration of the maximum degree in the duplication-divergence models, Second-order properties of undirected graphs, Positive semidefinite zero forcing, On the critical ideals of graphs, Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs, The planar Cayley graphs are effectively enumerable. II, A unified approach to distance-two colouring of graphs on surfaces, Pathwidth, trees, and random embeddings, Which $k$-trees are cover-incomparability graphs?, Communication constraints in the average consensus problem, On the hardness of losing width, Characterising planar Cayley graphs and Cayley complexes in terms of group presentations, Interpreting nowhere dense graph classes as a classical notion of model theory, On prisms, Möbius ladders and the cycle space of dense graphs, Digraph width measures in parameterized algorithmics, On approximating the $d$-girth of a graph, Priority functions for the approximation of the metric TSP, The distribution of cycles in breakpoint graphs of signed permutations, Characterizing graphs of small carving-width, Dynamic coloring and list dynamic coloring of planar graphs, On the number of disjoint pairs of S-permutation matrices, Equistable simplicial, very well-covered, and line graphs, Solution concepts for games with general coalitional structure, Searching for better fill-in, Adiabatic quantum programming: minor embedding with hard faults, Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices, On end degrees and infinite cycles in locally finite graphs, On differential Rota-Baxter algebras., On small contractible subgraphs in 3-connected graphs of small average degree, On the number of contractible triples in 3-connected graphs, Characterizing Valiant's algebraic complexity classes, Unnamed Item, MacLane's planarity criterion for locally finite graphs, Arboricity and tree-packing in locally finite graphs, Facets of the linear ordering polytope: a unification for the fence family through weighted graphs, There are uncountably many topological types of locally finite trees, A determinacy approach to Borel combinatorics, On the existence of $(k,l)$-kernels in infinite digraphs: a survey, The fractional chromatic number of triangle-free subcubic graphs, Lift-contractions, Nonnegatively curved 5-manifolds with almost maximal symmetry rank, Exact deterministic representation of Markovian SIR epidemics on networks with and without loops, The role of planarity in connectivity problems parameterized by treewidth, Remarks on nowhere-zero flows in signed cubic graphs, Threshold-based preprocessing for approximating the weighted dense $k$-subgraph problem, A 4D-sequencing approach for air traffic management, Infinite Hamilton cycles in squares of locally finite graphs, Perfect matchings in $r$-partite $r$-graphs, Projective, affine, and abelian colorings of cubic graphs, Bounded Embeddings of Graphs in the Plane, On the Complexity of Computing the k-restricted Edge-connectivity of a Graph, Colouring and Covering Nowhere Dense Graphs, Well-quasi-ordering Does Not Imply Bounded Clique-width, Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs, On Vertices and Facets of Combinatorial 2-Level Polytopes, Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs, Parameterized complexity of the maximum independent set problem and the speed of hereditary properties, On Stable Systems with Random Structure, Representation of $$k$$-mer Sets Using Spectrum-Preserving String Sets, Increasing the Minimum Degree of a Graph by Contractions, Planar Disjoint-Paths Completion, Proximity Search for Maximal Subgraph Enumeration, Unnamed Item, The fullerene graphs with a perfect star packing, Kernelization – Preprocessing with a Guarantee, Graph Minors and Parameterized Algorithm Design, Packing and Covering Immersion Models of Planar Subcubic Graphs, Harmonious Coloring: Parameterized Algorithms and Upper Bounds, Unnamed Item, Vertex decomposable graphs and obstructions to shellability, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, Querying Regular Graph Patterns, A Polynomial-Time Algorithm for Outerplanar Diameter Improvement, Edge-group choosability of outerplanar and near-outerplanar graphs, Connectivity of intersection graphs of finite groups, Ahlfors regularity and fractal dimension of Smale spaces, Online Matching in Regular Bipartite Graphs, Vertex Cover Reconfiguration and Beyond, On the connectivity of manifold graphs, A $$\varGamma $$-magic Rectangle Set and Group Distance Magic Labeling, The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements, Monotone Crossing Number, The total graph of unfaithful submodules of a module over reversible rings, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, Unnamed Item, A New Characterization of P 6-Free Graphs, Discovery of Network Properties with All-Shortest-Paths Queries, Self-stabilizing Cuts in Synchronous Networks, Unnamed Item, Unnamed Item, Additive Bases and Flows in Graphs, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, The Geometric Spectrum of a Graph and Associated Curvatures, Simplicial Topological Coding and Homology of Spin Networks, On a two-parameter generalization of Jacobsthal numbers and its graph interpretation, Unnamed Item, Counting Minimal Dominating Sets, Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions, Explaining Hierarchical Multi-linear Models, On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree, Hamiltonian cycles in some family of cubic 3-connected plane graphs, Dichotomy for Coloring of Dart Graphs, Graphs of Separability at Most Two: Structural Characterizations and Their Consequences, Unnamed Item, Tight Bounds for Linkages in Planar Graphs, The Planar Cubic Cayley Graphs, $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs, On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants, On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs, Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs, Unnamed Item, Overgroups of the Automorphism Group of the Rado Graph, Unnamed Item, Unnamed Item, Lamplighter graphs do not admit harmonic functions of finite energy, The word and geodesic problems in free solvable groups, Unnamed Item, Unnamed Item, Unnamed Item, Complexity Results for the Spanning Tree Congestion Problem, max-cut and Containment Relations in Graphs, Colouring Vertices of Triangle-Free Graphs, A Quartic Kernel for Pathwidth-One Vertex Deletion, An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion, Decompositional Petri Net Reductions, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, On Fibonacci numbers in edge coloured trees, 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces, The simultaneous conjugacy problem in the symmetric group, On the restricted size Ramsey number for P3 versus dense connected graphs, Spanning trees whose reducible stems have a few branch vertices, On Approximating the d-Girth of a Graph, Polyhedral embeddings of snarks in orientable surfaces, Dynamics and control for multi-agent networked systems: A finite-difference approach, König Graphs with Respect to the 4-Path and Its Spanning Supergraphs, Enumeration of Minimal Dominating Sets and Variants, Partitioning Graphs into Connected Parts, Deterministic Leader Election in Programmable Matter, Quick separation in chordal and split graphs, The Perfect Matching Reconfiguration Problem, On the Parameterised Intractability of Monadic Second-Order Logic, Graphs and Algorithms in Communication Networks on Seven League Boots, Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means, Frozen (Δ + 1)-colourings of bounded degree graphs, Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor, Fast Distributed Approximations in Planar Graphs, Unnamed Item, Restricted size Ramsey number for path of order three versus graph of order five, Sublinear Longest Path Transversals, $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs, Exponentially many hypohamiltonian snarks, On irreversible spread of influence in edge-weighted graphs, Some criteria for circle packing types and combinatorial Gauss-Bonnet Theorem, A survey of the studies on Gallai and anti-Gallai graphs, The completion of the hyperspace of finite subsets, endowed with the $\ell ^1$-metric, Control of multiagent networks with misbehaving nodes, On the graph of modules over commutative rings II, Tree-Depth and the Formula Complexity of Subgraph Isomorphism, Paths to Trees and Cacti, Definability in First Order Theories of Graph Orderings, Linkages in Polytope Graphs, Fast Robber in Planar Graphs, Digraph Decompositions and Monotonicity in Digraph Searching, Unnamed Item, Compactification and trees of spheres covers, Constructing certain families of 3‐polytopal graphs, Strong 3‐Flow Conjecture for projective planar graphs, Restricted size Ramsey number for P3 versus dense connected graphs of order six, Perfect matchings in highly cyclically connected regular graphs, A subquadratic algorithm for the simultaneous conjugacy problem, Edge-treewidth: algorithmic and combinatorial properties, The smallest hard trees, Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs, A $p$-centered coloring for the grid using $O(p)$ colors, A matching-minor monotone parameter for bipartite graphs, $P_k$-factors in squares and line graphs of trees, Approximating spaces of Nagata dimension zero by weighted trees, Binding number and path-factor critical deleted graphs, A quest for a fair schedule: the international Young Physicists' Tournament, The rainbow connection number of the enhanced power graph of a finite group, Distributed graph pattern matching via bounded dual simulation, Uniform even subgraphs and graphical representations of Ising as factors of i.i.d., On locally identifying coloring of graphs, 3-coloring $C_4$ or $C_3$-free diameter two graphs, On self-affine tiles that are homeomorphic to a ball, Odd Decompositions of Eulerian Graphs, Dimension reduction in the topology of multilayer spatial networks: the case of the interregional commuting in Greece, Progress on sufficient conditions for a graph to have a spanning $k$-ended tree, Fast computation of the centralizer of a permutation group in the symmetric group, Boolean dynamics revisited through feedback interconnections, On the weakly nilpotent graph of a commutative semiring, Computational graph pangenomics: a tutorial on data structures and their applications, Triangulations of uniform subquadratic growth are quasi-trees, Comparing the principal eigenvector of a hypergraph and its shadows, Online Matching in Regular Bipartite Graphs with Randomized Adversary, On the inverse graph of a finite group and its rainbow connection number, 2‐complexes with unique embeddings in 3‐space, The Zariski topology graph on scheme, About reversibility in sP colonies and reaction systems, Cographs and 1-sums, Chordal matroids arising from generalized parallel connections, On the Concentration of the Maximum Degree in the Duplication-Divergence Models, On planar Cayley graphs and Kleinian groups, NETWORK DESIGN FOR MINIMUM SPANNING TREES UNDER HAMMING DISTANCE, Unnamed Item, Every rayless graph has an unfriendly partition, On the Complexity of Recovering Incidence Matrices, COUNTERPARTY CREDIT RISK IN A CLEARING NETWORK, An approximate version of the Loebl-Komlós-Sós conjecture, Deciding whether a grid is a topological subgraph of a planar graph is NP-complete, Solving problems on generalized convex graphs via mim-width, On structural parameterizations of load coloring, -partite self-complementary and almost self-complementary -uniform hypergraphs, An approximate version of the Loebl-Komlós-Sós conjecture, Diverse Pairs of Matchings, DOMINATION NUMBER IN THE ANNIHILATING-SUBMODULE GRAPH OF MODULES OVER COMMUTATIVE RINGS, Fan type condition and characterization of Hamiltonian graphs, Lazy Constraint Imposing for Improving the Path Constraint, Robust Hamiltonicity of Dirac graphs, Induced Disjoint Paths in Claw-Free Graphs, The interactive sum choice number of graphs, A median-type condition for graph tiling, Ruling out FPT algorithms for weighted coloring on forests, The interactive sum choice number of graphs, Spectral characterization of some weighted rooted graphs with cliques, Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs, On the support of extremal martingale measures with given marginals: the countable case, Maximal Induced Matchings in Triangle-Free Graphs, Poset entropy versus number of linear extensions: the width-2 case., On self-affine tiles whose boundary is a sphere, Linear representation of transversal matroids and gammoids parameterized by rank, An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width, Spanning trees with at most 4 leaves in $K_{1, 5}$-free graphs, On Injective Colourings of Chordal Graphs, Unnamed Item, Decomposing split graphs into locally irregular graphs, Homomorphism Reconfiguration via Homotopy, Unnamed Item, On a new generalization of Jacobsthal quaternions and several identities involving these numbers, Weighted counting of solutions to sparse systems of equations, Editing to Connected F-Degree Graph, The order of the largest complete minor in a random graph, Unnamed Item, Searching for a Visible, Lazy Fugitive, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Dynamic programming for graphs on surfaces, Unnamed Item, Evaluation of the Copycat Model for Predicting Complex Network Growth, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Distinguished Minimal Topological Lassos, The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition, The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs, Distance Laplacian spectra of various graph operations and its application to graphs on algebraic structures