Pages that link to "Item:Q3680833"
From MaRDI portal
The following pages link to Graphs. Transl. from the French. 2nd rev. ed (Q3680833):
Displaying 28 items.
- Finite sets as complements of finite unions of convex sets (Q2391197) (← links)
- A one-sided many-to-many matching problem (Q2402821) (← links)
- Unions of digraphs which become kernel perfect (Q2420420) (← links)
- Perfect graphs, kernels, and cores of cooperative games (Q2433701) (← links)
- The complexity of minimum difference cover (Q2458927) (← links)
- Strong kernel number in certain oriented cycle extension of graphs (Q2516506) (← links)
- On \(\alpha\)-excellent graphs (Q2683166) (← links)
- Finite mappings and the topology of their stable sets (Q3018879) (← links)
- A Robust Conservative Mixed Finite Element Method for Isentropic Compressible Flow on Pipe Networks (Q3130406) (← links)
- Graphes. 3rd ed (Q3312256) (← links)
- (Q3313666) (← links)
- About the b-continuity of graphs (Q3439146) (← links)
- Kernel perfect and critical kernel imperfect digraphs structure (Q3439612) (← links)
- An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph (Q4917098) (← links)
- (Q4953557) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- Chemotaxis on networks: Analysis and numerical approximation (Q5118614) (← links)
- Some results on the <i>b</i>-chromatic number in complementary prism graphs (Q5244296) (← links)
- All Circuits Enumeration in Macro-Econometric Models (Q5302460) (← links)
- (Q5342392) (← links)
- Construction of some repeated measurements designs (Q5935445) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
- CKI-digraphs, generalized sums and partitions of digraphs (Q5964980) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)
- On the hardness of allocating frequencies for hybrid networks (Q6550553) (← links)
- Complexity results on \(k\)-independence in some graph products (Q6594024) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
