scientific article; zbMATH DE number 3338381
From MaRDI portal
Publication:5615282
Cited in
(only showing first 100 items - show all)- Preemptive scheduling and antichain polyhedra
- Weighted fusion graphs: Merging properties and watersheds
- Fusion graphs: merging properties and watersheds
- The complexity of clique graph recognition
- Graph coloring with cardinality constraints on the neighborhoods
- Mixed graph edge coloring
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- On the notion of cycles in hypergraphs
- A note on the girth of digraphs
- Arbres minimaux d'un graphe preordonne
- Nowhere-zero integral flows on a bidirected graph
- The 1-factorization of some line-graphs
- Sur la séparation dans les graphes de Cayley abéliens
- Estimates of general Mayer graphs. I. Construction of upper bounds for a given graph by means of sets of subgraphs. III. Upper bounds obtained by means of spanning n-trees. IV. On the computation of Gaussian integrals by star-mesh transformation
- Component structure in the evolution of random hypergraphs
- A three-dimensional quadratic nonconforming element
- Semigroups characterizing hypergraphs
- On the pseudo-steady-state approximation and Tikhonov theorem for general enzyme systems
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- On shortest cocycle covers of graphs
- Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnés
- On the Shannon capacity of a directed graph
- On Tutte polynomials and cycles of plane graphs
- Bipartable graphs
- Quelques utilisations de la STRUCTION. (Some applications of STRUCTION)
- A note on superbrittle graphs
- The Copeland choice function. An axiomatic characterization
- Partitions of digraphs into paths or circuits
- On randomized stopping points and perfect graphs
- Generating stable permutations
- Sur la contraction des graphes orientés en \(K^ *_ 3\). (On the contraction of digraphs onto \(K^ *_ 3)\)
- Large induced degenerate subgraphs
- Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
- On a relationship between Hadwiger and stability numbers
- On the null-homotopy of graphs
- Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid
- A note on visibility graphs
- A note on minimal directed graphs with given girth
- On the problem of how to represent a graph taking into account an additional structure
- Generalized neighbourhoods and a class of perfectly orderable graphs
- Graphical partially ordered sets
- Locally perfect graphs
- On the two-phase method for preemptive scheduling
- A discrete solenoidal finite difference scheme for the numerical approximation of incompressible flows
- Some models of graphs for scheduling sports competitions
- A fast algorithm for coloring Meyniel graphs
- A decomposition method for minimizing quadratic pseudo-Boolean functions
- On the Penrose number of cubic diagrams
- Deterministic synchronization of automata with bounded delay
- Flows and generalized coloring theorems in graphs
- Interval matroids and graphs
- Zur Theorie der perfekten Graphen
- On maximal independent sets of vertices in claw-free graphs
- Alcuni risultati sulla teoria degli ipergrafi
- Sur le spectre des opérateurs aux différences finies aléatoires
- On critically h-connected simple graphs
- About the shortest chain between two vertices in a quasi strongly connected digraph with a potential
- Reconstruction theorems for graph enumerating polynomials
- On multiply critically h-connected graphs
- Décomposition de \(K_ m\) + \(K_ n\) en cycles hamiltoniens
- An application of connectivity theory in graphs to factorizations of elements in groups
- Sous-graphes tracables des graphes infinis
- Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
- Couplages et transversaux généralises d'un hypergraphe infini
- A constructive approach to the critical problem for matroids
- Another characterization of hypercubes
- Parallel realization of permutations over trees
- On the enumeration of chains in regular chain-groups
- Sur la cardinalite maximum des couplages d'hypergraphes aléatoires uniformes
- Optimal implementation of selectors in a data-base
- A normalization theorem for regular homotopy of finite directed graphs
- Evaluations asymptotiques du nombre des cliques des hypergraphes uniformes
- On a conjecture of Entringer and Slater
- k-optimal partitions of a directed graph
- On the existence of 2-designs Slambda(2,3,v) without repeated blocks
- Transitive multipermutation graphs: Case \(4\leq n\leq m\)
- A Sperner-type theorem and qualitative independence
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- Graphs and topologies on discrete sets
- The connectivity of hierarchical Cayley digraphs
- Qualitative independence and Sperner problems for directed graphs
- Numero cromatico, omomorfismi e colorazioni d'ungrafo
- On parity patterns of even q-angulations
- Hypermaps versus bipartite maps
- Un algorithme combinatoire pour la résolution des problèmes du type du permanent
- Random hypertrees and hyperforests
- Some remarks on good colorations
- Un problème extremal pour les graphes et les hypergraphes
- Nombres de coloration de l'hypergraphe h-parti complet
- Complexite et circuits euleriens dans les sommes tensorielles de graphes
- Some observations on the determination of an upper bound for the clique number of a graph
- Groupes de permutations primitifs d'ordre impair et denombrement de tournois sommet-primitifs
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales
- Théorie des ecoulements dans les graphes orientes sans circuit
- Multicolorings, measures and games on graphs
- Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
- Développements recents de la théorie des graphes
- The intersection numbers of a complex
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5615282)
