scientific article; zbMATH DE number 1194938
From MaRDI portal
Publication:4208001
zbMath0914.05049MaRDI QIDQ4208001
Tristan Denley, Armen S. Asratian, Roland Haeggkvist
Publication date: 31 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bipartite graphshypercubesstochastic matricestreesmatchingslatin squaresfactorsexpandersedge-coloringsEvans conjecturevan der Waerden's conjecture
Trees (05C05) Applications of graph theory (05C90) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Orthogonal arrays, Latin squares, Room squares (05B15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (90)
Further results on the deficiency of graphs ⋮ Flow distances on open flow networks ⋮ Interval cyclic edge-colorings of graphs ⋮ The many facets of the Estrada indices of graphs and networks ⋮ Graphs determined by polynomial invariants ⋮ On the Hamiltonicity of random bipartite graphs ⋮ One-sided interval edge-colorings of bipartite graphs ⋮ How many TCR clonotypes does a body maintain? ⋮ Constructions of binary codes based on bipartite graphs ⋮ FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ Stochastic forms of non-negative matrices and Perron-regularity ⋮ Chordal multipartite graphs and chordal colorings ⋮ Results on the Grundy chromatic number of graphs ⋮ On Co-completek–partite Graph Valued Functions ⋮ Bipartite opinion forming: towards consensus over coopetition networks ⋮ On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs ⋮ A passivity-based approach to voltage stabilization in DC microgrids with ZIP loads ⋮ A generalization of interval edge-colorings of graphs ⋮ A note on one-sided interval edge colorings of bipartite graphs ⋮ On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs ⋮ The minimum maximal k-partial-matching problem ⋮ LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs ⋮ Continuous 2-colorings and topological dynamics ⋮ Deep graphs—A general framework to represent and analyze heterogeneous complex systems across scales ⋮ Uniform chain decompositions and applications ⋮ Interval colorings of graphs—Coordinated and unstable no‐wait schedules ⋮ Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs ⋮ A note on upper bounds for the maximum span in interval edge-colorings of graphs ⋮ On bounded block decomposition problems for under-specified systems of equations ⋮ Relating zeta functions of discrete and quantum graphs ⋮ Synchronization of oscillators not sharing a common ground ⋮ On universal positive graphs ⋮ Upper bounds on ATSP neighborhood size. ⋮ Locally finite homogeneous graphs ⋮ Grundy coloring in some subclasses of bipartite graphs and their complements ⋮ Generic pole assignability, structurally constrained controllers and unimodular completion ⋮ On resistance of graphs ⋮ On the intricacy of avoiding multiple-entry arrays ⋮ A Note on the Existence of All (g,f)-Factors ⋮ On sum edge-coloring of regular, bipartite and split graphs ⋮ A note on graphs contraction-critical with respect to independence number ⋮ A network game with attackers and a defender ⋮ Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs ⋮ Consecutive edge-coloring of the generalized \(\theta \)-graph ⋮ Some properties of graphs constructed from 2-designs ⋮ The normalized Laplacian spectrum of subdivisions of a graph ⋮ Bipartite partial duals and circuits in medial graphs ⋮ Blockers for the stability number and the chromatic number ⋮ Improper interval edge colorings of graphs ⋮ Consecutive colouring of oriented graphs ⋮ Bicolored matchings in some classes of graphs ⋮ Bicolored matchings in some classes of graphs ⋮ On complexity of special maximum matchings constructing ⋮ Avoiding Arrays of Odd Order by Latin Squares ⋮ Interval edge-colorings of composition of graphs ⋮ Bipartite graphs as polynomials and polynomials as bipartite graphs ⋮ The computational complexity of the parallel knock-out problem ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition ⋮ NP-hardness of compact scheduling in simplified open and flow shops. ⋮ Borel oracles. An analytical approach to constant-time algorithms ⋮ Interval edge-colorings of complete graphs and \(n\)-dimensional cubes ⋮ Process flexibility: design, evaluation, and applications ⋮ Path colorings in bipartite graphs ⋮ Spectra of conic carbon radicals ⋮ Cycle double covers and spanning minors. I ⋮ Compact scheduling of zero-one time operations in multi-stage systems ⋮ Level of repair analysis and minimum cost homomorphisms of graphs ⋮ Independence and matching numbers of some token graphs ⋮ Majorization and distances in trees ⋮ Graphs with few distinct eigenvalues and extremal energy ⋮ Distributed branch points and the shape of elastic surfaces with constant negative curvature ⋮ Matchings in connection with ground delay program planning ⋮ Cyclic deficiency of graphs ⋮ Partial cubes: Structures, characterizations, and constructions ⋮ On path factors of \((3,4)\)-biregular bigraphs ⋮ Restricted completion of sparse partial Latin squares ⋮ On avoiding some families of arrays ⋮ Unnamed Item ⋮ Pell graphs ⋮ Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs ⋮ Eigenvector-based identification of bipartite subgraphs ⋮ Using the classical model for source attribution of pathogen-caused illnesses. Lessons from conducting an ample structured expert judgment study ⋮ A generalized class-teacher model for some timetabling problems ⋮ Unnamed Item ⋮ Complexity of some special types of timetabling problems ⋮ Majorization-constrained doubly stochastic matrices ⋮ On a conjecture of Füredi. ⋮ Partitioning the Boolean lattice into chains of large minimum size
This page was built for publication:
