Pages that link to "Item:Q3680833"
From MaRDI portal
The following pages link to Graphs. Transl. from the French. 2nd rev. ed (Q3680833):
Displaying 50 items.
- Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs (Q299098) (← links)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- On edge-\(b\)-critical graphs (Q476322) (← links)
- Graphical reduction of reaction networks by linear elimination of species (Q504070) (← links)
- Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs (Q510598) (← links)
- A new generalization of kernels in digraphs (Q516902) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Connection between conjunctive capacity and structural properties of graphs (Q744094) (← links)
- Realizations of branched self-coverings of the 2-sphere (Q891243) (← links)
- On clustering tree structured data with categorical nature (Q947987) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Kernels and partial line digraphs (Q990794) (← links)
- A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629) (← links)
- On strong digraphs with a unique minimally strong subdigraph (Q1102301) (← links)
- The bulk-synchronous parallel random access machine (Q1128714) (← links)
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967) (← links)
- Some operations preserving the existence of kernels (Q1301845) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- Average distance and independence number (Q1329805) (← links)
- Different capacities of a digraph (Q1334937) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- New extensions of kernel perfect digraphs to kernel imperfect critical digraphs (Q1343226) (← links)
- Over testable languages (Q1351950) (← links)
- Node packings on cocomparability graphs (Q1400341) (← links)
- Tension-flow polynomials on graphs (Q1421520) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- Matchings in graphs and groups (Q1671337) (← links)
- A characterization of \(b_e\)-critical trees (Q1700040) (← links)
- A characterization of edge \(b\)-critical graphs (Q1701125) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- Graphs and recursively defined towers of function fields (Q1773329) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Graph decompositions and secret sharing schemes (Q1842517) (← links)
- A polynomial algorithm for the strong Helly property (Q1847378) (← links)
- A new greedoid: The family of local maximum stable sets of a forest (Q1850118) (← links)
- Polynomials associated with nowhere-zero flows (Q1850590) (← links)
- On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments (Q1877676) (← links)
- Note on the game chromatic index of trees (Q1884997) (← links)
- Combinatorial games on a graph (Q1916376) (← links)
- The simulated trading heuristic for solving vehicle routing problems (Q1917260) (← links)
- Optimal wavelength routing on directed fiber trees (Q1960521) (← links)
- Centers of complex networks (Q2177250) (← links)
- Cut-threshold graphs (Q2277496) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Characterization of color patterns by dynamic \(H\)-paths (Q2322868) (← links)
- \(H\)-paths and \(H\)-cycles in \(H\)-coloured digraphs (Q2345526) (← links)
- Sperner capacities (Q2366215) (← links)
