Search results for "Claw"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Alain Hertz, Vadim V. Lozin, David Schindl	Finding augmenting chains in extensions of claw-free graphs.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
16	Kazuo Iwama, Akinori Kawachi	A New Quantum Claw-finding Algorithm for Three Functions.	New Gener. Comput.	2003	DBLP DOI BibTeX RDF
16	Mingchu Li	Circumferences of 2-Connected Claw-Free Graphs.	Ars Comb.	2003	DBLP BibTeX RDF
16	Odile Favaron	Independence and upper irredundance in claw-free graphs.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
16	Andreas Brandstädt, Feodor F. Dragan	On linear and circular structure of (claw, net)-free graphs.	Discret. Appl. Math.	2003	DBLP DOI BibTeX RDF
16	Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson	The asymptotic number of claw-free cubic graphs.	Discret. Math.	2003	DBLP DOI BibTeX RDF
16	Rao Li 0001, Richard H. Schelp	Every 3-connected distance claw-free graph is Hamilton-connected.	Discret. Math.	2003	DBLP DOI BibTeX RDF
16	Rao Li 0001	Hamiltonicity of 3-connected quasi-claw-free graphs.	Discret. Math.	2003	DBLP DOI BibTeX RDF
16	Odile Favaron, Michael A. Henning	Upper total domination in claw-free graphs.	J. Graph Theory	2003	DBLP DOI BibTeX RDF
16	Daya Ram Gaur, Ramesh Krishnamurti	Scheduling Intervals Using Independent Sets in Claw-Free Graphs.	ICCSA (1)	2003	DBLP DOI BibTeX RDF
16	John M. Harris, Michael J. Mossinghoff	Traceability in Small Claw-Free Graphs.	Electron. Notes Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Luitpold Babel, Andreas Brandstädt, Van Bang Le	Recognizing the P4-structure of claw-free graphs and a larger graph class.	Discret. Math. Theor. Comput. Sci.	2002	DBLP DOI BibTeX RDF
16	Edgar M. Palmer, Ronald C. Read, Robert W. Robinson	Counting Claw-Free Cubic Graphs.	SIAM J. Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Guojun Li, Binhai Zhu, Chuanping Chen	On Connected [k, k+1]-Factors in Claw-Free Graphs.	Ars Comb.	2002	DBLP BibTeX RDF
16	Mingchu Li	Hamiltonian Cycles in N2-Locally Connected Claw-Free Graphs.	Ars Comb.	2002	DBLP BibTeX RDF
16	Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani	An approximation result for the interval coloring problem on claw-free chordal graphs.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
16	Harald Hempel, Dieter Kratsch	On claw-free asteroidal triple-free graphs.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
16	Yevgeniy Dodis, Leonid Reyzin	On the Power of Claw-Free Permutations.	IACR Cryptol. ePrint Arch.	2002	DBLP BibTeX RDF
16	Guojun Li, Mei Lu, Zhenghong Liu	Hamiltonian cycles in 3-connected Claw-free graphs.	Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Ondrej Kovárík, Milos Mulac, Zdenek Ryjácek	A note on degree conditions for hamiltonicity in 2-connected claw-free graphs.	Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda	Path factors in claw-free graphs.	Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Mingquan Zhan	Neighborhood intersections and Hamiltonicity in almost claw-free graphs.	Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Ronald J. Gould, Florian Pfender	Pancyclicity in claw-free graphs.	Discret. Math.	2002	DBLP DOI BibTeX RDF
16	Gianpaolo Oriolo	Clique Covers in Claw-Free Berge Graphs.	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Waclaw Frydrych	Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Zdenek Ryjácek, Akira Saito, Richard H. Schelp	Claw-free graphs with complete closure.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Hajo Broersma, Zdenek Ryjácek	Strengthening the closure concept in claw-free graphs.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Ronald J. Gould, Michael S. Jacobson	Two-factors with few cycles in claw-free graphs.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Odile Favaron, Michael A. Henning, Joël Puech, Dieter Rautenbach	On domination and annihilation in graphs with claw-free blocks.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Xiaotao Cai, Warren E. Shreve	Pancyclicity mod k of claw-free graphs and K1, 4-free graphs.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Odile Favaron, Evelyne Flandrin, Hao Li 0002, Zdenek Ryjácek	Clique covering and degree conditions for hamiltonicity in claw-free graphs.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Matthias Kriesell	All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected.	J. Comb. Theory, Ser. B	2001	DBLP DOI BibTeX RDF
16	Odile Favaron, Pierre Fraisse	Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs.	J. Comb. Theory, Ser. B	2001	DBLP DOI BibTeX RDF
16	Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek	On factors of 4-connected claw-free graphs.	J. Graph Theory	2001	DBLP DOI BibTeX RDF
16	Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer	On weights of induced paths and cycles in claw-free and K1, r-free graphs.	J. Graph Theory	2001	DBLP DOI BibTeX RDF
16	Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito	2-factors in claw-free graphs.	Discuss. Math. Graph Theory	2000	DBLP DOI BibTeX RDF
16	Mingchu Li	Longest Cycles in Almost Claw-Free Graphs.	Graphs Comb.	2000	DBLP DOI BibTeX RDF
16	Halina Bielak	Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs.	Discret. Math.	2000	DBLP DOI BibTeX RDF
16	Rao Li 0001	A Fan-type condition for claw-free graphs to be Hamiltonian.	Discret. Math.	2000	DBLP DOI BibTeX RDF
16	Piotr Berman	A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs.	Nord. J. Comput.	2000	DBLP BibTeX RDF
16	Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler	Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.	SIAM J. Comput.	2000	DBLP DOI BibTeX RDF
16	Stephan Brandt, Odile Favaron, Zdenek Ryjácek	Closure and stable Hamiltonian properties in claw-free graphs.	J. Graph Theory	2000	DBLP DOI BibTeX RDF
16	Chuanping Chen, Amel Harkat-Benhamdine, Hao Li 0002	Distance-Dominating Cycles in Quasi Claw-Free Graphs.	Graphs Comb.	1999	DBLP DOI BibTeX RDF
16	Andreas Brandstädt, Peter L. Hammer	On the Stability Number of Claw-free P5-free and More General Graphs.	Discret. Appl. Math.	1999	DBLP DOI BibTeX RDF
16	Yu Sheng, Feng Tian 0008, Bing Wei 0001	Panconnectivity of locally connected claw-free graphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Odile Favaron, Joël Puech	Irredundant and perfect neighborhood sets in graphs and claw-free graphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Ralph J. Faudree, Odile Favaron, Evelyne Flandrin, Hao Li 0002, Zhenhong Liu	On 2-factors in claw-free graphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp	Closure and Hamiltonian-connectivity of claw-free graphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Huib Trommel, Henk Jan Veldman, A. Verschut	Pancyclicity of claw-free hamiltonian graphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Jan Brousek, Zdenek Ryjácek, Odile Favaron	Forbidden subgraphs, hamiltonicity and closure in claw-free graphs.	Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Stephan Brandt	9-Connected Claw-Free Graphs Are Hamilton-Connected.	J. Comb. Theory, Ser. B	1999	DBLP DOI BibTeX RDF
16	Frédéric Maffray, Bruce A. Reed	A Description of Claw-Free Perfect Graphs.	J. Comb. Theory, Ser. B	1999	DBLP DOI BibTeX RDF
16	Zdenek Ryjácek, Akira Saito, Richard H. Schelp	Closure, 2-factors, and cycle coverings in claw-free graphs.	J. Graph Theory	1999	DBLP DOI BibTeX RDF
16	Mingchu Li	Hamiltonian Connectedness in Claw-Free Graphs.	Graphs Comb.	1998	DBLP DOI BibTeX RDF
16	Mingchu Li	On Pancyclic Claw-Free Graphs.	Ars Comb.	1998	DBLP BibTeX RDF
16	Sho Ishizuka	Closure, Path-Factors and Path Coverings in Claw-Free Graphs.	Ars Comb.	1998	DBLP BibTeX RDF
16	Jan Brousek	Minimal 2-connected non-hamiltonian claw-free graphs.	Discret. Math.	1998	DBLP DOI BibTeX RDF
16	Hong Wang 0005	Triangles in claw-free graphs.	Discret. Math.	1998	DBLP DOI BibTeX RDF
16	Mingchu Li	Vertex pancyclism in claw-free graphs.	Discret. Math.	1998	DBLP DOI BibTeX RDF
16	Ahmed Ainouche	Quasi-claw-free graphs.	Discret. Math.	1998	DBLP DOI BibTeX RDF
16	Hajo Broersma, Huib Trommel	Closure concepts for claw-free graphs.	Discret. Math.	1998	DBLP DOI BibTeX RDF
16	Cláudia Linhares Sales, Frédéric Maffray	Even Pairs in Claw-Free Perfect Graphs.	J. Comb. Theory, Ser. B	1998	DBLP DOI BibTeX RDF
16	Waclaw Frydrych, Zdzislaw Skupien	Non-traceability of large connected claw-free graphs.	J. Graph Theory	1998	DBLP DOI BibTeX RDF
16	Gilles Brassard, Peter Høyer, Alain Tapp	Quantum Cryptanalysis of Hash and Claw-Free Functions.	LATIN	1998	DBLP DOI BibTeX RDF
16	Ralph J. Faudree, Zdenek Ryjácek, Ingo Schiermeyer	Local connectivity and cycle xtension in claw-free graphs.	Ars Comb.	1997	DBLP BibTeX RDF
16	Gilles Brassard, Peter Høyer, Alain Tapp	Quantum cryptanalysis of hash and claw-free functions.	SIGACT News	1997	DBLP DOI BibTeX RDF
16	Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Amel Harkat-Benhamdine, Hao Li 0002	Dlambda-cycles in lambda-claw-free graphs.	Discret. Math.	1997	DBLP DOI BibTeX RDF
16	Ralph J. Faudree, Evelyne Flandrin, Zdenek Ryjácek	Claw-free graphs - A survey.	Discret. Math.	1997	DBLP DOI BibTeX RDF
16	Zdenek Ryjácek	Matching extension in K1, r-free graphs with independent claw centers.	Discret. Math.	1997	DBLP DOI BibTeX RDF
16	Hao Li 0002, Mei Lu, Feng Tian 0008, Bing Wei 0001	Hamiltonicity of 2-connected claw-center independent graphs.	Discret. Math.	1997	DBLP DOI BibTeX RDF
16	Gang Yu, Olivier Goldschmidt	Local Optimality and Its Application on Independent Sets for k-claw Free Graphs.	J. Comb. Optim.	1997	DBLP DOI BibTeX RDF
16	Zdenek Ryjácek	On a Closure Concept in Claw-Free Graphs.	J. Comb. Theory, Ser. B	1997	DBLP DOI BibTeX RDF
16	Anna Galluccio, Antonio Sassano	The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.	J. Comb. Theory, Ser. B	1997	DBLP DOI BibTeX RDF
16	Randall Brukardt, Tom Moran	CLAW, a High Level, Portable, Ada 95 Binding for Microsoft Windows.	TRI-Ada	1997	DBLP DOI BibTeX RDF	Ada
16	Odile Favaron, Evelyne Flandrin, Hao Li 0002, Zdenek Ryjácek	Shortest walks in almost claw-free graphs.	Ars Comb.	1996	DBLP BibTeX RDF
16	Bert L. Hartnell, Michael D. Plummer	On 4-connected Claw-free Well-covered Graphs.	Discret. Appl. Math.	1996	DBLP DOI BibTeX RDF
16	Mingchu Li	Hamiltonian cycles in regular 3-connected claw-free graphs.	Discret. Math.	1996	DBLP DOI BibTeX RDF
16	David Tankus, Michael Tarsi	Well-Covered Claw-Free Graphs.	J. Comb. Theory, Ser. B	1996	DBLP DOI BibTeX RDF
16	Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer	Toughness and hamiltonicity in almost claw-free graphs.	J. Graph Theory	1996	DBLP DOI BibTeX RDF
16	Hortensia Galeana-Sánchez	On claw-free M-oriented critical kernel-imperfect digraphs.	J. Graph Theory	1996	DBLP DOI BibTeX RDF
16	Armen S. Asratian	Every 3-connected, locally connected, claw-free graph is Hamilton-connected.	J. Graph Theory	1996	DBLP DOI BibTeX RDF
16	Zdenek Ryjácek	Hamiltonicity in claw-free graphs through induced bulls.	Discret. Math.	1995	DBLP DOI BibTeX RDF
16	Mingchu Li	Longest cycles in regular 2-connected claw-free graphs.	Discret. Math.	1995	DBLP DOI BibTeX RDF
16	Bhalchandra D. Thatte	Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs.	J. Graph Theory	1995	DBLP DOI BibTeX RDF
16	Hao Li	Hamiltonian cycles in 2-connected claw-free-graphs.	J. Graph Theory	1995	DBLP DOI BibTeX RDF
16	Haitze J. Broersma, M. Lu	Cycles through particular subgraphs of claw-free graphs.	J. Graph Theory	1995	DBLP DOI BibTeX RDF
16	Michael D. Plummer	Extending matchings in claw-free graphs.	Discret. Math.	1994	DBLP DOI BibTeX RDF
16	Evelyne Flandrin, Hao Li 0002	Mengerian properties, hamiltonicity, and claw-free graphs.	Networks	1994	DBLP DOI BibTeX RDF
16	Zdenek Ryjácek	Almost claw-free graphs.	J. Graph Theory	1994	DBLP DOI BibTeX RDF
16	Vasek Chvátal	Which Claw-Free Graphs are Perfectly Orderable?	Discret. Appl. Math.	1993	DBLP DOI BibTeX RDF
16	Evelyne Flandrin, Jean-Luc Fouquet, Hao Li 0002	On hamiltonian claw-free graphs.	Discret. Math.	1993	DBLP DOI BibTeX RDF
16	Mingchu Li	Hamiltonian cycles in 3-connected claw-free graphs.	J. Graph Theory	1993	DBLP DOI BibTeX RDF
16	William R. Pulleyblank, F. Bruce Shepherd	Formulations for the stable set polytope of a claw-free graph.	IPCO	1993	DBLP BibTeX RDF
16	F. Bruce Shepherd	Hamiltonicity in claw-free graphs.	J. Comb. Theory, Ser. B	1991	DBLP DOI BibTeX RDF
16	Yahya Ould Hamidoune	On the numbers of independent k-sets in a claw free graph.	J. Comb. Theory, Ser. B	1990	DBLP DOI BibTeX RDF
16	Marek Chrobak, Joseph Naor, Mark B. Novick	Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs.	WADS	1989	DBLP DOI BibTeX RDF
16	Vasek Chvátal, Najiba Sbihi	Recognizing claw-free perfect graphs.	J. Comb. Theory, Ser. B	1988	DBLP DOI BibTeX RDF
16	Mark N. Ellingham, László Pyber, Xingxing Yu	Claw-free graphs are edge reconstructible.	J. Graph Theory	1988	DBLP DOI BibTeX RDF
16	Cun-Quan Zhang	Hamilton cycles in claw-free graphs.	J. Graph Theory	1988	DBLP DOI BibTeX RDF
16	Wen-Lian Hsu, George L. Nemhauser	A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs.	Discret. Math.	1982	DBLP DOI BibTeX RDF