EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: person:"Trotignon, Nicolas"
Narrow search

Narrow search

Year of publication
Subject
All
decomposition 10 2-join 6 Berge graph 4 Perfect graph 4 detection 4 recognition 4 subgraph 4 3-in-a-tree 2 4-in-a-tree 2 Berge 2 Cycle with a unique chord 2 Detection 2 Graph 2 Heawood graph 2 Induced 2 Petersen graph 2 Recognition algorithm 2 algorithm 2 balanced skew partition 2 coloring 2 combinatorial algorithms 2 even skew partition 2 four 2 induced 2 maximum weight clique algorithm 2 perfect graphs 2 skew partition 2 star decompositions 2 structure 2 tree 2 triangle-free graphs 2 Three 1 three 1
more ... less ...
Online availability
All
Free 24
Type of publication
All
Book / Working Paper 24
Language
All
Undetermined 14 English 10
Author
All
Trotignon, Nicolas 24 Maffray, Frédéric 9 Lévêque, Benjamin 6 Vuskovic, Kristina 5 Derhy, Nicolas 3 Lin, David Y. 3 Picouleau, Christophe 3 Kristina Vuškovi? 1
more ... less ...
Institution
All
HAL 16 Centre d'Économie de la Sorbonne, Université Paris 1 (Panthéon-Sorbonne) 4 Maison des Sciences Économiques, Université Paris 1 (Panthéon-Sorbonne) 4
Published in...
All
Post-Print / HAL 8 Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) 8 Cahiers de la Maison des Sciences Economiques 4 Documents de travail du Centre d'Economie de la Sorbonne 4
Source
All
RePEc 24
Showing 1 - 10 of 24
Cover Image
The four-in-a-tree problem in triangle-free graphs
Derhy, Nicolas; Picouleau, Christophe; Trotignon, Nicolas - HAL - 2008
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question : how does look like a triangle-free...
Persistent link: https://www.econbiz.de/10010750367
Saved in:
Cover Image
A structure theorem for graphs with no cycle with a unique chord and its consequences
Trotignon, Nicolas; Vuskovic, Kristina - HAL - 2008
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with...
Persistent link: https://www.econbiz.de/10010750604
Saved in:
Cover Image
A structure theorem for graphs with no cycle with a unique chord and its consequences.
Trotignon, Nicolas; Kristina Vuškovi? - Centre d'Économie de la Sorbonne, Université Paris 1 … - 2008
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with...
Persistent link: https://www.econbiz.de/10005797739
Saved in:
Cover Image
The four-in-a-tree problem in triangle-free graphs.
Derhy, Nicolas; Picouleau, Christophe; Trotignon, Nicolas - Centre d'Économie de la Sorbonne, Université Paris 1 … - 2008
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question : how does look like a triangle-free...
Persistent link: https://www.econbiz.de/10005696778
Saved in:
Cover Image
A structure theorem for graphs with no cycle with a unique chord and its consequences
Trotignon, Nicolas; Vuskovic, Kristina - HAL - 2008
We give a structural description of the class C of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in C is a either in some simple basic class or has a decomposition. Basic classes are cliques, bipartite graphs with...
Persistent link: https://www.econbiz.de/10008795590
Saved in:
Cover Image
The four-in-a-tree problem in triangle-free graphs
Derhy, Nicolas; Picouleau, Christophe; Trotignon, Nicolas - HAL - 2008
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the following question : how does look like a triangle-free...
Persistent link: https://www.econbiz.de/10008795708
Saved in:
Cover Image
Detecting induced subgraphs.
Lévêque, Benjamin; Lin, David Y.; Maffray, Frédéric; … - Centre d'Économie de la Sorbonne, Université Paris 1 … - 2007
An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdivisible edges of B into paths of arbitrary length (at least one). Given an s-graph B, we study the decision problem Pi(B) whose instance is a graph G and...
Persistent link: https://www.econbiz.de/10005510609
Saved in:
Cover Image
Detecting induced subgraphs
Lévêque, Benjamin; Lin, David Y.; Maffray, Frédéric; … - HAL - 2007
An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graphB is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one). Given an s-graph B, we study the decision problem Pi(B) whose instance is a...
Persistent link: https://www.econbiz.de/10010750644
Saved in:
Cover Image
On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph
Lévêque, Benjamin; Maffray, Frédéric; Trotignon, Nicolas - HAL - 2007
We prove a decomposition theorem for graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph.
Persistent link: https://www.econbiz.de/10010750650
Saved in:
Cover Image
On graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph.
Lévêque, Benjamin; Maffray, Frédéric; Trotignon, Nicolas - Centre d'Économie de la Sorbonne, Université Paris 1 … - 2007
We prove a decomposition theorem for graphs that do not contain a subdivision of the complete graph on four vertices as an induced subgraph.
Persistent link: https://www.econbiz.de/10005670856
Saved in:
  • 1
  • 2
  • 3
  • Next
  • Last
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...