Publication:5315023
From MaRDI portal
zbMath1074.05001MaRDI QIDQ5315023
Publication date: 6 September 2005
68R10: Graph theory (including graph drawing) in computer science
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
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, 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, Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups, 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, 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, A note on graph minors and strong products, Infinite highly connected planar graphs of large girth, An algorithmic approach to finding factorial designs with generalized minimum aberration, Bicycles and left-right tours in locally finite graphs, 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, 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, Lamplighter graphs do not admit harmonic functions of finite energy, The word and geodesic problems in free solvable groups, Searching for a Visible, Lazy Fugitive, Fast Robber in Planar Graphs, Digraph Decompositions and Monotonicity in Digraph Searching, On Injective Colourings of Chordal Graphs, An approximate version of the Loebl-Komlós-Sós conjecture, Spectral characterization of some weighted rooted graphs with cliques, The order of the largest complete minor in a random graph, 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, Deterministically isolating a perfect matching in bipartite planar graphs, Constraint satisfaction with succinctly specified relations, Pursuing a fast robber on a graph, NP-hardness results for the aggregation of linear orders into median orders, Packing tripods: narrowing the density gap, Moduli spaces of metric graphs of genus 1 with marks on vertices, Matroid representation of clique complexes, Graph-like continua, augmenting arcs, and Menger's theorem, Partitioning 3-homogeneous Latin bitrades, On Hamiltonicity of \{claw, net\}-free graphs, 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, 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, Infinite Hamilton cycles in squares of locally finite graphs, Perfect matchings in \(r\)-partite \(r\)-graphs, Projective, affine, and abelian colorings of cubic graphs, 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, Vertex decomposable graphs and obstructions to shellability, Partitioning Graphs into Connected Parts, Graphs and Algorithms in Communication Networks on Seven League Boots, Exponentially many hypohamiltonian snarks, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, A New Characterization of P 6-Free Graphs, Discovery of Network Properties with All-Shortest-Paths Queries, Self-stabilizing Cuts in Synchronous Networks, On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants, Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs, Decompositional Petri Net Reductions, Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings, 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces, Polyhedral embeddings of snarks in orientable surfaces, On the Parameterised Intractability of Monadic Second-Order Logic, Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor, Fast Distributed Approximations in Planar Graphs
