Search results for "Claw-free"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
132	Van Bang Le, Raffaele Mosca, Haiko Müller	On Stable Cutsets in Claw-Free Graphs and Planar Graphs.	WG	2005	DBLP DOI BibTeX RDF
127	Mingchu Li	Hamiltonian Cycles in Almost Claw-Free Graphs.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
118	Elkin Vumar	On the Circumference of 3-Connected Quasi-Claw-Free Graphs.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Circumference, Quasi-claw-free graphs, Claw-free graphs
115	Odile Favaron, Michael A. Henning	Paired-Domination in Claw-Free Cubic Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Claw-Free cubic graphs, Paired-domination, Bounds
105	Mingchu Li, Liming Xiong, Hong Liu	Linear Polynomial-Time Algorithms To Construct 4-Connected 4-Regular Locally Connected Claw-Free Graphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	constructive characterization, linear polynomial-time, claw-free graph
92	Hajo Broersma, Daniël Paulusma	Computing Sharp 2-Factors in Claw-Free Graphs.	MFCS	2008	DBLP DOI BibTeX RDF
92	Yevgeniy Dodis, Leonid Reyzin	On the Power of Claw-Free Permutations.	SCN	2002	DBLP DOI BibTeX RDF
82	Daniel Kobler, Udi Rotics	Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size.	Algorithmica	2003	DBLP DOI BibTeX RDF	Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs
76	Hong Wang 0005	Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05C70
74	Anna Galluccio, Claudio Gentile, Paolo Ventura	On the Stable Set Polytope of Claw-Free Graphs.	COCOA	2008	DBLP DOI BibTeX RDF
74	Daishin Nakamura, Akihisa Tamura	The Generalized Stable Set Problem for Claw-Free Bidirected Graphs.	IPCO	1998	DBLP DOI BibTeX RDF
74	Wakaha Ogata, Kaoru Kurosawa	On Claw Free Families.	ASIACRYPT	1991	DBLP DOI BibTeX RDF
71	Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura	The stable set polytope of quasi-line graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57, 90C10
71	Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura	Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.	IPCO	2005	DBLP DOI BibTeX RDF
70	Qiuxin Wu, Liming Xiong, Tingzeng Wu	Even Factors with Degree at Most Four in Claw-Free Graphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	even factor, branch-bond, claw-free graph
66	Yuichi Komano, Kazuo Ohta, Atsushi Shimbo, Shin-ichi Kawamura	Formal Security Model of Multisignatures.	ISC	2006	DBLP DOI BibTeX RDF	multisignature scheme, claw-free permutation, random oracle model, formal security model
66	Harald Hempel, Dieter Kratsch	On Claw-Free Asteroidal Triple-Free Graphs.	WG	1999	DBLP DOI BibTeX RDF
59	Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer	A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs.	IPCO	2008	DBLP DOI BibTeX RDF
59	Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca	Independent Sets of Maximum Weight in Apple-Free Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
56	Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma	Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.	WG	2009	DBLP DOI BibTeX RDF
56	Xueliang Li 0001, Wenan Zang	A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	algorithm, complexity, graph coloring, network flow, perfect graph
56	Xiaoying Qu, Houyuan Lin	Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF
56	Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs.	Algorithmica	2003	DBLP DOI BibTeX RDF	Sum Coloring, Scheduling dependent jobs, Approximation algorithms, Multicoloring
53	Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler	Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.	WG	1999	DBLP DOI BibTeX RDF
52	Paul Dorbec, Sylvain Gravier, Michael A. Henning	Paired-domination in generalized claw-free graphs.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Generalized claw-free graphs, Paired-domination, Bounds
51	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma	Upper Bounds and Algorithms for Parallel Knock-Out Numbers.	SIROCCO	2007	DBLP DOI BibTeX RDF	parallel knock-out schemes, computational complexity, claw-free graphs
49	Zuosong Liang, Erfang Shan, T. C. Edwin Cheng	Clique-Transversal Sets in Cubic Graphs.	ESCAPE	2007	DBLP DOI BibTeX RDF	Clique-transversal number, Claw-free, Bound, Cubic graph
43	Vadim V. Lozin, Martin Milanic	A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.	SODA	2006	DBLP DOI BibTeX RDF	polynomial-time algorithm, independent set
43	Alexander Russell	Necessary and Sufficient Conditions For Collision-Free Hashing.	CRYPTO	1992	DBLP DOI BibTeX RDF
42	Ugo Pietropaoli	Some classical combinatorial problems on circulant and claw-free graphs: the isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs.	4OR	2009	DBLP DOI BibTeX RDF
40	Fedor V. Fomin, Petr A. Golovach	Interval Completion with the Smallest Max-degree.	WG	1998	DBLP DOI BibTeX RDF
39	Mingchu Li	Hamiltonian Connected Claw-Free Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
39	Piotr Berman	A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs.	SWAT	2000	DBLP DOI BibTeX RDF
35	Gianpaolo Oriolo, Gautier Stauffer	Clique-circulants and the stable set polytope of fuzzy circular interval graphs.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57
35	Gregory Neven	Efficient Sequential Aggregate Signed Data.	EUROCRYPT	2008	DBLP DOI BibTeX RDF
35	Arnaud Pêcher, Annegret Wagler	Almost all webs are not rank-perfect.	Math. Program.	2006	DBLP DOI BibTeX RDF	Rank-perfect graph, Stable set polytope, (Non-)rank facet, Web
35	Yevgeniy Dodis, Roberto Oliveira 0001, Krzysztof Pietrzak	On the Generic Insecurity of the Full Domain Hash.	CRYPTO	2005	DBLP DOI BibTeX RDF
35	Vadim E. Levit, Eugen Mandrescu	On Unimodality of Independence Polynomials of Some Well-Covered Trees.	DMTCS	2003	DBLP DOI BibTeX RDF
35	Gerrit Bleumer, Birgit Pfitzmann, Michael Waidner	A Remark on a Signature Scheme Where Forgery Can Be Proved.	EUROCRYPT	1990	DBLP DOI BibTeX RDF
31	Philippe Gambette, Stéphane Vialette	On Restrictions of Balanced 2-Interval Graphs.	WG	2007	DBLP DOI BibTeX RDF	2-interval graphs, graph classes, quasi-line graphs, circular interval graphs, scheduling, bioinformatics, line graphs, claw-free graphs
31	Shafi Goldwasser, Silvio Micali, Ronald L. Rivest	A "Paradoxical" Solution to the Signature Problem (Extended Abstract)	FOCS	1984	DBLP DOI BibTeX RDF	claw-free pairs of functions, authentication, cryptography, digital signatures, randomization, factoring, chosen message attacks
30	Michitaka Furuya, Shoichi Tsuchiya	Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free.	Graphs Comb.	2015	DBLP DOI BibTeX RDF
26	Hui Ma, Xiaomin Hu, Weihua Yang	On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs.	Discret. Math.	2023	DBLP DOI BibTeX RDF
26	Yingjun Dai, Angèle M. Foley, Chính T. Hoàng	On coloring a class of claw-free and hole-twin-free graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
26	Xia Liu, Liming Xiong	A note on 3-connected hourglass-free claw-free Hamilton-connected graphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
26	Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew	Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs.	MFCS	2022	DBLP DOI BibTeX RDF
26	Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew	Conflict-free coloring on open neighborhoods of claw-free graphs.	CoRR	2021	DBLP BibTeX RDF
26	Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou	Pancyclicity of 4-connected claw-free net-free graphs.	Australas. J Comb.	2020	DBLP BibTeX RDF
26	Charles B. Crane	Hamiltonian Type Properties in Claw-Free P5-Free Graphs.	Graphs Comb.	2016	DBLP DOI BibTeX RDF
26	Bert Seamone	On uniquely Hamiltonian claw-free and triangle-free graphs.	Discuss. Math. Graph Theory	2015	DBLP DOI BibTeX RDF
26	Zdenek Ryjácek, Liming Xiong, Jun Yin	Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs.	Graphs Comb.	2015	DBLP DOI BibTeX RDF
26	Wei Xiong 0002, Hong-Jian Lai, Xiaoling Ma, Keke Wang, Meng Zhang 0005	Hamilton cycles in 3-connected claw-free and net-free graphs.	Discret. Math.	2013	DBLP DOI BibTeX RDF
26	Michael Ferrara, Timothy Morris, Paul S. Wenger	Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs.	J. Graph Theory	2012	DBLP DOI BibTeX RDF
26	Mingchu Li, Xiaodong Chen, Hajo Broersma	Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs.	J. Graph Theory	2011	DBLP DOI BibTeX RDF
26	Hong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan	Every 3-connected claw-free Z8-free graph is Hamiltonian.	J. Graph Theory	2010	DBLP DOI BibTeX RDF
26	Daniel Meister 0001	Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
26	Tomasz Luczak 0001, Florian Pfender	Claw-free 3-connected P11-free graphs are hamiltonian.	J. Graph Theory	2004	DBLP DOI BibTeX RDF
26	Harald Hempel, Dieter Kratsch	On claw-free asteroidal triple-free graphs.	Discret. Appl. Math.	2002	DBLP DOI BibTeX RDF
26	Xiaotao Cai, Warren E. Shreve	Pancyclicity mod k of claw-free graphs and K1, 4-free graphs.	Discret. Math.	2001	DBLP DOI BibTeX RDF
26	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
26	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
23	Ivan Damgård	Collision Free Hash Functions and Public Key Signature Schemes.	EUROCRYPT	1987	DBLP DOI BibTeX RDF
21	Euiwoong Lee, Pasin Manurangsi	Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs.	ITCS	2024	DBLP DOI BibTeX RDF
21	Zhenmeng Han, Qing Cui	A note on strong edge-coloring of claw-free cubic graphs.	J. Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
21	Junyi Xiao, Jianhua Tu	Maximizing the number of independent sets in claw-free cubic graphs.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
21	Seungjae Eom, Kenta Ozeki	A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph.	Graphs Comb.	2023	DBLP DOI BibTeX RDF
21	Michitaka Furuya, Mikio Kano	Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs.	Graphs Comb.	2023	DBLP DOI BibTeX RDF
21	Yuquan Lin, Wensong Lin	The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs.	Graphs Comb.	2023	DBLP DOI BibTeX RDF
21	Euiwoong Lee, Pasin Manurangsi	Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
21	Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase	Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations.	CoRR	2023	DBLP DOI BibTeX RDF
21	Xiaogang Cheng, Ren Guo	Better Quantum Seal Schemes based on Trapdoor Claw-Free Functions.	CoRR	2023	DBLP DOI BibTeX RDF
21	Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Katrin Wagler	Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
21	Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim	Domination versus edge domination on claw-free graphs.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
21	Xia Liu, Hong-Jian Lai	Hamilton-connected claw-free graphs with Ore-degree conditions.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
21	Yuzhen Qi, Yun Wang, Jin Yan	Disjoint cycles with partial degree conditions in claw-free graphs.	Discret. Math.	2023	DBLP DOI BibTeX RDF
21	Lucía Busolini, Guillermo Durán, Martín D. Safe	Characterization of balanced graphs within claw-free graphs.	LAGOS	2023	DBLP DOI BibTeX RDF
21	Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase	Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations.	WAOA	2023	DBLP DOI BibTeX RDF
21	Zbigniew Lonc	Approximating Fair Division on D-Claw-Free Graphs.	IJCAI	2023	DBLP DOI BibTeX RDF
21	Elena Mohr, Dieter Rautenbach	On Hamiltonian cycles in claw-free cubic graphs.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
21	Zuosong Liang	Total coloring of claw-free planar graphs.	Discuss. Math. Graph Theory	2022	DBLP DOI BibTeX RDF
21	Wanpeng Lei, Liming Xiong, Jun Yin	The Independence Number Conditions for 2-Factors of a Claw-Free Graph.	Axioms	2022	DBLP DOI BibTeX RDF
21	Ahmad Biniaz	Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs.	J. Graph Algorithms Appl.	2022	DBLP DOI BibTeX RDF
21	Csilla Bujtás, Vesna Irsic, Sandi Klavzar	1/2-conjectures on the domination game and claw-free graphs.	Eur. J. Comb.	2022	DBLP DOI BibTeX RDF
21	Barnaby Martin, Daniël Paulusma, Siani Smith	Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
21	Ammar Babikir, Michael A. Henning	Upper Total Domination in Claw-Free Cubic Graphs.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
21	Jian-Bo Lv, Jianxi Li, Xiaoxia Zhang	On Strong Edge-Coloring of Claw-Free Subcubic Graphs.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
21	Hangdi Chen, Changhong Lu, Qingjie Ye	Generalized Power Domination in Claw-Free Regular Graphs.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
21	Meike Neuwohner	Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs.	CoRR	2022	DBLP BibTeX RDF
21	Xingyu Yan, Licheng Wang, Weiqiang Wen, Ziyi Li, Jingwen Suo, Lize Gu	Post-Quantum κ-to-1 Trapdoor Claw-free Functions from Extrapolated Dihedral Cosets.	CoRR	2022	DBLP DOI BibTeX RDF
21	Qing Cui, Zhenmeng Han	List star edge-coloring of claw-free subcubic multigraphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
21	Juan Wang, Zuosong Liang, Jiansheng Cai, Lianying Miao	Acyclic coloring of claw-free graphs with small degree.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
21	Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi	Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Zhi-Hong Chen	Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs, II.	Discret. Math.	2022	DBLP DOI BibTeX RDF
21	Ammar Babikir, Michael A. Henning	Domination versus total domination in claw-free cubic graphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
21	Christoph Brause, Trung Duy Doan, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána	Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4.	Discret. Math.	2022	DBLP DOI BibTeX RDF
21	Petr Vrána, Xingzhi Zhan, Leilei Zhang	Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected.	Discret. Math.	2022	DBLP DOI BibTeX RDF
21	Shanshan Zhang, Xiumei Wang, Jinjiang Yuan, C. T. Ng 0001, T. C. E. Cheng	On cycle-nice claw-free graphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
21	Xiaodong Chen, Mingchu Li, Liming Xiong	Two completely independent spanning trees of claw-free graphs.	Discret. Math.	2022	DBLP DOI BibTeX RDF
21	Navid Alamati, Giulio Malavolta, Ahmadreza Rahimi	Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols.	TCC (1)	2022	DBLP DOI BibTeX RDF
21	Peter Nelson, Kazuhiro Nomoto	The structure of claw-free binary matroids.	J. Comb. Theory, Ser. B	2021	DBLP DOI BibTeX RDF