Combinatorial identification problems and graph powers
DOI10.1007/s10288-011-0167-7zbMath1237.05048OpenAlexW2082763530MaRDI QIDQ766254
Publication date: 23 March 2012
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://pastel.archives-ouvertes.fr/pastel-00593649/file/theseDA4Juin.pdf
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Cites Work
This page was built for publication: Combinatorial identification problems and graph powers