Constrained ear decompositions in graphs and digraphs

Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a given graph admits an ear decomposition in whi...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Mathematics and Theoretical Computer Science Vol. 21 no. 4; no. Graph Theory; pp. COV2 - 19
Main Authors:	Havet, Frédéric, Nisse, Nicolas
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 02.09.2019 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-cc]computer science [cs]/computational complexity [cs.cc] [info.info-dm]computer science [cs]/discrete mathematics [cs.dm] Computational Complexity Computer Science Decomposition Decomposition (Mathematics) Discrete Mathematics Ear Graph theory Graphs Handles Integers Mathematical research Polynomials Traveling salesman problem France
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!