Found: 13
Select item for more details and to access through your institution.
TWIN-WIDTH AND PERMUTATIONS.
- Published in:
- Logical Methods in Computer Science (LMCS), 2024, v. 20, n. 3, p. 4:1, doi. 10.46298/LMCS-20(3:4)2024
- By:
- Publication type:
- Article
(Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth.
- Published in:
- Journal of Graph Theory, 2021, v. 97, n. 4, p. 624, doi. 10.1002/jgt.22675
- By:
- Publication type:
- Article
Edge‐decomposing graphs into coprime forests.
- Published in:
- Journal of Graph Theory, 2021, v. 97, n. 1, p. 21, doi. 10.1002/jgt.22638
- By:
- Publication type:
- Article
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.
- Published in:
- Journal of Graph Theory, 2014, v. 75, n. 3, p. 284, doi. 10.1002/jgt.21740
- By:
- Publication type:
- Article
Parameterized Domination in Circle Graphs.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 1, p. 45, doi. 10.1007/s00224-013-9478-8
- By:
- Publication type:
- Article
Packing and Covering Triangles in K-free Planar Graphs.
- Published in:
- Graphs & Combinatorics, 2012, v. 28, n. 5, p. 653, doi. 10.1007/s00373-011-1071-9
- By:
- Publication type:
- Article
Small degree out-branchings (This work was initiated while the authors attended the DCI 2001 workshop on tournaments at DIMACS. We gratefully acknowledge financial support by DIMACS.).
- Published in:
- Journal of Graph Theory, 2003, v. 42, n. 4, p. 297
- By:
- Publication type:
- Article
Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 4, p. 244, doi. 10.1002/1097-0118(200012)35:4<244::AID-JGT2>3.0.CO;2-H
- By:
- Publication type:
- Article
Separation Choosability and Dense Bipartite Induced Subgraphs.
- Published in:
- Combinatorics, Probability & Computing, 2019, v. 28, n. 5, p. 720, doi. 10.1017/S0963548319000026
- By:
- Publication type:
- Article
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs.
- Published in:
- Combinatorics, Probability & Computing, 2012, v. 21, n. 4, p. 512, doi. 10.1017/S0963548312000065
- By:
- Publication type:
- Article
WDM and Directed Star Arboricity.
- Published in:
- Combinatorics, Probability & Computing, 2010, v. 19, n. 2, p. 161, doi. 10.1017/S0963548309990551
- By:
- Publication type:
- Article
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.
- Published in:
- Combinatorics, Probability & Computing, 2007, v. 16, n. 1, p. 1, doi. 10.1017/S0963548306007887
- By:
- Publication type:
- Article
A $$\tau $$ -Conjecture for Newton Polygons.
- Published in:
- Foundations of Computational Mathematics, 2015, v. 15, n. 1, p. 185, doi. 10.1007/s10208-014-9216-x
- By:
- Publication type:
- Article