STABIL/README.rst at master · kini/STABIL · GitHub
github.com
Some old C code for cellular refinement of graphs, based on http://arxiv.org/abs STABIL/README.rst at master · kini/STABIL
oDOBS - Author page: Gottfried Tinhofer
lupus.cs.uni-dortmund.de
Luitpold BABEL, Gottfried TINHOFER: Hard-to-color Graphs for Connected Sequential Colorings , Gottfried TINHOFER, H. SCHRECK: The Bounded Subset Sum ...
oDOBS - Author page: Stephan Olariu
lupus.cs.uni-dortmund.de
Luitpold BABEL, Stephan OLARIU: A New Characterization of P4-connected Graphs Stephan OLARIU, James L. SCHWING: A Novel Deterministic Sampling Scheme with ...
Hard-to-color Graphs for Connected Sequential Colorings - Luitpold...
books.google.de
Hard-to-color Graphs for Connected Sequential Colorings. Front Cover. Luitpold Babel, Gottfried Tinhofer. Inst., Univ., Graph theory pages.
Hard-to-color graphs for connected sequential colorings - [PDF...
vdocuments.site
colorings Luitpold Babel *, Gottfried Tinhofer Insiitut fiir Mathematik.
Recognition and isomorphism of tree-like P4-connected graphs
pdfslide.us
of tree-like P4-connected graphs( Luitpold Babel ∗;1 ...
Discrete Mathematics & Theoretical Computer Science - EMIS
www.emis.de
von L Babel · · Zitiert von: 2 — author: Luitpold Babel and Andreas Brandstädt and Van Bang Le. title: Recognizing the P4-structure of claw-free graphs and a larger graph class. › abstracts › d...
Ton Kloks - DBLP
dblp.uni-trier.de
— Luitpold Babel, Ton Kloks, Jan Kratochvíl , Dieter Kratsch, Haiko Müller, Stephan Olariu: Efficient algorithms for graphs with few P4's. › pid › To...
Recognizing the P_4-structure of claw-free graphs and a larger graph...
core.ac.uk
Luitpold Babel, Andreas Brandstädt and Van Bang Le ...
Discrete Mathematics & Theoretical Computer Science - oalib
www.oalib.com
Recognizing the P 4-structure of claw-free graphs and a larger graph class · Luitpold Babel,Andreas Brandst？dt,Van Bang Le ... › journal
Alle Infos zum Namen "Luitpold Babel"
"On the p-Connectedness of Graphs – a Survey" by Luitpold Babel and...
digitalcommons.odu.edu
A graph is said to be p-connected if for every partition of its vertices into two non-empty, disjoint, sets some chordless path with three edges contains...
"Efficient Algorithms for Graphs with Few P-4's" by Luitpold ...digitalcommons.odu.edu › comput...
digitalcommons.odu.edu
Authors. Luitpold Babel · Ton Kloks · Jan Kratochvíl · Dieter Kratsch · Kaiko Müller · Stephan Olariu, Old Dominion UniversityFollow ...
Encore -- Graph-theoretic concepts in computer science : 24th...
searchmobius.org
Luitpold Babel Stephan OlariuMinimum Fill-in and Treewidth for Graphs
...
Recognizing the P_4-structure of claw-free graphs and a larger graph...
hal.archives-ouvertes.fr
Luitpold Babel, Andreas Brandstädt, Van Bang Le. Recognizing the P_4-structure of claw-free graphs and a larger graph class. Discrete Mathematics and ...
Contradicting claims about complexity of directed path graphs...
mathoverflow.net
Directed path graph isomorphism, Luitpold Babel, Ilia Ponomarenko, Gottfried Tinhofer. We prove that deciding isomorphism of directed path ...
Home pages of people interested in perfect graphs
users.encs.concordia.ca
David Avis · Luitpold Babel · Claude Berge · Endre Boros · Andreas Brandstädt · Michel Burlet · Leizhen Cai · Kathie Cameron · Maria ...
Recognizing the P_4-structure of claw-free graphs and Inriahal.inria.fr › hal
hal.inria.fr
Luitpold Babel, Andreas Brandstädt, van Bang Le. Recognizing the P_4-structure of claw-free graphs and a larger graph class. Discrete Mathematics and ...
Split-Perfect Graphs: Characterizations and Algorithmic Use
epubs.siam.org
— [2] Luitpold BabelAndreas Brandstädt and , Van Le, Recognizing the P 4 ‐structure of bipartite graphs, Discrete Appl. Math., 93 (1999), ... › doi
Tree - like P connected graphs
www.infona.pl
A graph is P connected if for every partition of its vertices into two nonempty disjoint sets there is a chordless path on four vertices which...
Verwandte Suchanfragen zu Luitpold Babel
| Andreas Brandstädt Dieter Kratsch Stephan Olariu | Haiko Müller Gottfried Tinhofer |
Person "Babel" (3) Vorname "Luitpold" (132) Name "Babel" (556) |
sortiert nach Relevanz / Datum