FindingH-partitions efficiently-Reference-Cited by-同舟云学术

FindingH-partitions efficiently

Published:2005-01 Issue:1 Volume:39 Page:133-144
ISSN:0988-3754
Container-title:RAIRO - Theoretical Informatics and Applications
language:
Short-container-title:RAIRO-Theor. Inf. Appl.

Author:

Dantas Simone,de Figueiredo Celina M.H.,Gravier Sylvain,Klein Sulamita

Publisher

EDP Sciences

Subject

Computer Science Applications,General Mathematics,Software

Link

http://www.rairo-ita.org/10.1051/ita:2005008/pdf

Reference7 articles.

1. K. Cameron, E.M. Eschen, C.T. Hoàng and R. Sritharan, The list partition problem for graphs, inProc. of the ACM-SIAM Symposium on Discrete Algorithms – SODA 2004. ACM, New York and SIAM, Philadelphia (2004) 384–392.

2. M. Chudnovsky, N. Robertson, P. Seymour and R. Thomas, Strong Perfect Graph Theorem, inPerfect Graph Conjecture workshop. American Institute of Mathematics (2002).

3. Star-cutsets and perfect graphs

4. Finding Skew Partitions Efficiently

5. List Homomorphisms to Reflexive Graphs

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. No-Rainbow Problem and the Surjective Constraint Satisfaction Problem;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

2. Disconnected cuts in claw-free graphs;Journal of Computer and System Sciences;2020-11

3. The computational complexity of disconnected cut and 2K2-partition;Journal of Combinatorial Theory, Series B;2015-03

4. Graph partitions with prescribed patterns;European Journal of Combinatorics;2014-01

5. Obstructions to partitions of chordal graphs;Discrete Mathematics;2013-10