Even Directed Cycles in H-Free Digraphs

Author： Galluccio A.   Loebl M.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.27, Iss.1, 1998-04, pp. : 26-41

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Cycles in dense digraphs

By Chudnovsky Maria  

Combinatorica, Vol. 28, Iss. 1, 2008-01 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite

Consistent Cycles in Graphs and Digraphs

By Miklavič Štefko   Potočnik Primož   Wilson Steve  

Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. : 205-216

Springer Publishing Company

Access to resources Recommend Favorite

The Reverse H‐free Process for Strictly 2‐Balanced Graphs

By  

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 2, 2015-06 ,pp. : 125-144

John Wiley & Sons Inc

Access to resources Recommend Favorite

Almost Symmetric Cycles in Large Digraphs

By Adamus Lech   Wojda A. Paweł  

Graphs and Combinatorics, Vol. 22, Iss. 4, 2006-12 ,pp. : 443-452

Springer Publishing Company

Access to resources Recommend Favorite

Embedding even-length cycles in a hexagonal honeycomb mesh

By Yang Xiaofan  

International Journal of Computer Mathematics, Vol. 85, Iss. 2, 2008-02 ,pp. : 201-209

Taylor & Francis Ltd

Access to resources Recommend Favorite