Search results for "Line-graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	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
52	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
51	Robert Kincaid, Heidi Lam	Line graph explorer: scalable display of line graphs using Focus+Context.	AVI	2006	DBLP DOI BibTeX RDF	Focus+Context, line graph
39	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
39	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
33	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
31	Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong	The Kr-Packing Problem.	Computing	2001	DBLP DOI BibTeX RDF	AMS Subject Classifications: 05C70, 68Q20, 05C85
28	Wen-Lian Hsu	The coloring and maximum independent set problems on planar perfect graphs.	J. ACM	1988	DBLP DOI BibTeX RDF
28	Wen-Lian Hsu	Recognizing planar perfect graphs.	J. ACM	1987	DBLP DOI BibTeX RDF
28	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
27	Yiming Zhang 0003, Ling Liu 0001, Dongsheng Li 0001, Xicheng Lu	Distributed Line Graphs: A Universal Framework for Building DHTs Based on Arbitrary Constant-Degree Graphs.	ICDCS	2008	DBLP DOI BibTeX RDF
26	Cengiz Acartürk, Christopher Habel, Kursat Cagiltay	Multimodal Comprehension of Graphics with Textual Annotations: The Role of Graphical Means Relating Annotations and Graph Lines.	Diagrams	2008	DBLP DOI BibTeX RDF	text-graphics comprehension, annotations, temporal relations, line graphs
26	Igor E. Zverovich	A Solution to a Problem of Jacobson, Kézdy and Lehel.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Line graphs of linear hypergraphs, Forbidden induced subgraphs
25	Paolo Detti, Carlo Meloni, Marco Pranzo	Local search algorithms for finding the Hamiltonian completion number of line graphs.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Hamiltonian completion number, Dominating trail set, Local search, Graph algorithms, Line graphs
25	Rameshsharma Ramloll, Wai Yu, Stephen A. Brewster, Beate Riedel, Mike Burton, Gisela Dimigen	Constructing sonified haptic line graphs for the blind student: first steps.	ASSETS	2000	DBLP DOI BibTeX RDF	visual impairment, force feedback, haptic display, spatial sound, line graphs
25	Van Bang Le, Raffaele Mosca, Haiko Müller	On Stable Cutsets in Claw-Free Graphs and Planar Graphs.	WG	2005	DBLP DOI BibTeX RDF
25	David Morgan	A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs.	WADS	2005	DBLP DOI BibTeX RDF
24	Anna Galluccio, Claudio Gentile, Paolo Ventura	On the Stable Set Polytope of Claw-Free Graphs.	COCOA	2008	DBLP DOI BibTeX RDF
23	Nikhil Bansal 0001, Amit Chakrabarti, Amir Epstein, Baruch Schieber	A quasi-PTAS for unsplittable flow on line graphs.	STOC	2006	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, resource allocation, approximation scheme, unsplittable flow
22	Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser	On the number of plane graphs.	SODA	2006	DBLP DOI BibTeX RDF
22	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Weighted Node Coloring: When Stable Sets Are Expensive.	WG	2002	DBLP DOI BibTeX RDF
22	Petr Hlinený, Jan Kratochvíl	Computational Complexity of the Krausz Dimension of Graphs.	WG	1997	DBLP DOI BibTeX RDF
22	Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Improved bounds for scheduling conflicting jobs with minsum criteria.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	sum multicoloring, scheduling, Approximation algorithms, linear programming, coloring, LP rounding
22	Andreas Brandstädt, Chính T. Hoàng	Maximum Induced Matchings for Chordal Graphs in Linear Time.	Algorithmica	2008	DBLP DOI BibTeX RDF	Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm
22	Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai	Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.	WAOA	2004	DBLP DOI BibTeX RDF
21	Michele Conforti, Gérard Cornuéjols	Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs.	J. Comb. Theory, Ser. B	2003	DBLP DOI BibTeX RDF
21	D. V. S. Sastry, B. Syam Prasad Raju	Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs.	Discret. Math.	1984	DBLP DOI BibTeX RDF
21	Jin Akiyama, Takashi Hamada	The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests.	Discret. Math.	1979	DBLP DOI BibTeX RDF
21	Kent Wittenburg, Tom Lanning, Darren Leigh, Kathy Ryall	Visualizing antenna design spaces.	AVI	2008	DBLP DOI BibTeX RDF	antenna design, human-guided search, information visualization, multivariate visualization, line graphs
20	Peng Wu 0003, Sandra Carberry, Daniel Chester, Stephanie Elzer	Decision Tree Induction for Identifying Trends in Line Graphs.	ISMIS	2008	DBLP DOI BibTeX RDF
20	Liming Xiong, Roman Kuzel	A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	AMS Subject Classification (2000). 05C45, 05C35
20	Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler	Characterizing and bounding the imperfection ratio for some classes of graphs.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57 (90C27)
19	Naoki Katoh, Shin-ichi Tanigawa	Fast enumeration algorithms for non-crossing geometric graphs.	SCG	2008	DBLP DOI BibTeX RDF	non-crossing geometric graphs, triangulation, enumeration
19	Huiqiu Lin, Weihua Yang, Hailiang Zhang, Jinlong Shu	Outerplanarity of line graphs and iterated line graphs.	Appl. Math. Lett.	2011	DBLP DOI BibTeX RDF
19	Thomas Andreae, Martin Schughart, Zsolt Tuza	Clique-transversal sets of line graphs and complements of line graphs.	Discret. Math.	1991	DBLP DOI BibTeX RDF
17	Stephen H. Unger	GIT - a heuristic program for testing pairs of directed line graphs for isomorphism.	Commun. ACM	1964	DBLP DOI BibTeX RDF
17	Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee	Path connectivity of line graphs and total graphs of complete bipartite graphs.	Appl. Math. Comput.	2023	DBLP DOI BibTeX RDF
17	Mahdi Reza Khorsandi	Graphs whose line graphs are ring graphs.	AKCE Int. J. Graphs Comb.	2020	DBLP DOI BibTeX RDF
17	Derek A. Holton, Dingjun Lou, K. L. McAvaney	n-extendability of line graphs, power graphs, and total graphs.	Australas. J Comb.	1995	DBLP BibTeX RDF
17	Khaled M. Elbassioni, René Sitters, Yan Zhang 0021	A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.	ESA	2007	DBLP DOI BibTeX RDF
17	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
16	Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser	Enumerating Order Types for Small Point Sets with Applications.	Order	2002	DBLP DOI BibTeX RDF	planar straight-line graphs, realizable matroids, computational geometry, order types
15	Van Bang Le, Florian Pfender	Color-line and proper color-line graphs.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
15	Van Bang Le, Florian Pfender	Color-line and Proper Color-line Graphs.	CoRR	2015	DBLP BibTeX RDF
15	David DiMarco	Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity.	Ars Comb.	2008	DBLP BibTeX RDF
15	David DiMarco	Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity.	Ars Comb.	2008	DBLP BibTeX RDF
15	D. Di Marco	Realizability of p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity.	Ars Comb.	2002	DBLP BibTeX RDF
15	David DiMarco	Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree.	Networks	2000	DBLP DOI BibTeX RDF
15	Francis T. Boesch, Charles L. Suffel	Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree.	Networks	1982	DBLP DOI BibTeX RDF
15	S. Chastel, Philippe Colantoni, Alain Bretto	Displaying Image Neighborhood Hypergraphs Line-Graphs.	DGCI	2002	DBLP DOI BibTeX RDF
14	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Time slot scheduling of compatible jobs.	J. Sched.	2007	DBLP DOI BibTeX RDF	Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling
14	Eric Neufeld, Sonje Kristtorn	Picturing Causality - The Serendipitous Semiotics of Causal Graphs.	Smart Graphics	2005	DBLP DOI BibTeX RDF
14	Garth Isaak	Sum List Coloring Block Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Sum coloring, Block graphs, List coloring
14	Ton Kloks, Dieter Kratsch, Haiko Müller	Dominoes.	WG	1994	DBLP DOI BibTeX RDF
13	Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic	Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.	J. Comb. Theory, Ser. B	2024	DBLP DOI BibTeX RDF
13	Joao Domingos Gomes da Silva Junior, Carla Silva Oliveira, Liliana Manuela Gaspar C. da Costa	Some results involving the Aα-eigenvalues for graphs and line graphs.	CoRR	2024	DBLP DOI BibTeX RDF
13	Laithun Boro, Madan Mohan Singh	Line graphs associated to Von Neumann regular graphs of rings.	Discret. Math. Algorithms Appl.	2024	DBLP DOI BibTeX RDF
13	M. A. Shalu, Cyriac Antony	Star Colouring of Regular Graphs Meets Weaving and Line Graphs.	CALDAM	2024	DBLP DOI BibTeX RDF
13	Michael Ostroski, Geoffrey Sanders, Trevor Steil, Roger Pearce	Scalable Edge Clustering of Dynamic Graphs via Weighted Line Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
13	Hechao Liu, Yufei Huang	Sharp bounds on the symmetric division deg index of graphs and line graphs.	Comput. Appl. Math.	2023	DBLP DOI BibTeX RDF
13	Marco Caoduro, Lyuben Lichev	On the boxicity of Kneser graphs and complements of line graphs.	Discret. Math.	2023	DBLP DOI BibTeX RDF
13	S. Ganesamurthy	Decompositions of line graphs of complete graphs into paths and cycles.	Discret. Math.	2023	DBLP DOI BibTeX RDF
13	Matteo Cavaleri, Daniele D'Angeli, Alfredo Donno	Characterizations of line graphs in signed and gain graphs.	Eur. J. Comb.	2022	DBLP DOI BibTeX RDF
13	Si-Ao Xu, Yun-Xiang Li, Hongbo Hua, Xiang-Feng Pan	On the resistance diameters of graphs and their line graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
13	Guohui Li, Minjie Zhang	Sharp bounds on the Arithmetic-geometric index of graphs and line graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
13	Tsai-Lien Wong	2-connected chordal graphs and line graphs are (1, 5)-choosable.	Eur. J. Comb.	2021	DBLP DOI BibTeX RDF
13	Devsi Bantva, Daphne Der-Fen Liu	Optimal radio labellings of block graphs and line graphs of trees.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
13	Devsi Bantva, Daphne Der-Fen Liu	Optimal Radio Labellings of Block Graphs and Line Graphs of Trees.	CoRR	2021	DBLP BibTeX RDF
13	S. Mohan, J. Geetha 0001, K. Somasundaram 0001	Total coloring of quasi-line graphs and inflated graphs.	Discret. Math. Algorithms Appl.	2021	DBLP DOI BibTeX RDF
13	S. Arumugam 0001, Jay S. Bagga	Graphoidal graphs and graphoidal digraphs: a generalization of line graphs.	AKCE Int. J. Graphs Comb.	2020	DBLP DOI BibTeX RDF
13	Yufei Huang, Weihua He, Guixian Huang, Hong-Jian Lai, Sulin Song	A characterization of graphs with supereulerian line graphs.	Int. J. Comput. Math. Comput. Syst. Theory	2020	DBLP DOI BibTeX RDF
13	Wenzhong Liu, Huazheng You, Qing Cui	On even cycle decompositions of line graphs of cubic graphs.	Discret. Math.	2020	DBLP DOI BibTeX RDF
13	Yuanqiu Huang, Tinglei Zhao, Zongpeng Ding	Graphs whose crossing numbers are the same as those of their line graphs.	Australas. J Comb.	2020	DBLP BibTeX RDF
13	Xiaoling Zhang 0006	Inertia and distance energy of line graphs of unicyclic graphs.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
13	S. Ganesamurthy, P. Paulraja, R. Srimathi	Multidecompositions of line graphs of complete graphs.	Discret. Math. Algorithms Appl.	2019	DBLP DOI BibTeX RDF
13	Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou	On s-hamiltonian line graphs of claw-free graphs.	Discret. Math.	2019	DBLP DOI BibTeX RDF
13	Aras Erzurumluoglu, Karen Meagher, David A. Pike	Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs.	Graphs Comb.	2018	DBLP DOI BibTeX RDF
13	Prasad Krishnan	Coded Caching via Line Graphs of Bipartite Graphs.	CoRR	2018	DBLP BibTeX RDF
13	Prasad Krishnan	Coded Caching via Line Graphs of Bipartite Graphs.	ITW	2018	DBLP DOI BibTeX RDF
13	Karuvachery Pravas, Ambat Vijayakumar	On an edge partition and root graphs of some classes of line graphs.	Electron. J. Graph Theory Appl.	2017	DBLP DOI BibTeX RDF
13	Andrea Munaro	On line graphs of subcubic triangle-free graphs.	Discret. Math.	2017	DBLP DOI BibTeX RDF
13	Fengming Dong, Weigen Yan	Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
13	Muhammad Faisal Nadeem, Sohail Zafar, Zohaib Zahid	On topological properties of the line graphs of subdivision graphs of certain nanostructures.	Appl. Math. Comput.	2016	DBLP DOI BibTeX RDF
13	Ruhul Amin 0002, Sk. Md. Abu Nayeem	On the F-index and F-coindex of the line graphs of the subdivision graphs.	CoRR	2016	DBLP BibTeX RDF
13	Harishchandra S. Ramane, Ashwini S. Yalnaik	Reciprocal complementary distance spectra and reciprocal complementary distance energy of line graphs of regular graphs.	Electron. J. Graph Theory Appl.	2015	DBLP DOI BibTeX RDF
13	Gurusamy Rengasamy Vijayakumar	Uniquely Derived Generalized Line Graphs and Uniquely Represented Signed Graphs with Least Eigenvalues ≥ -2.	Graphs Comb.	2015	DBLP DOI BibTeX RDF
13	Xiangwen Li, Yan Xiong	Collapsible graphs and Hamilton cycles of line graphs.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
13	Lu Bai 0001, Zhihong Zhang 0001, Chaoyan Wang, Edwin R. Hancock	An Edge-Based Matching Kernel for Graphs Through the Directed Line Graphs.	CAIP (2)	2015	DBLP DOI BibTeX RDF
13	Qingning Wang, Liming Xiong	Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs.	Int. J. Comput. Math.	2014	DBLP DOI BibTeX RDF
13	Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo	Collapsible Graphs and Hamiltonicity of Line Graphs.	Graphs Comb.	2014	DBLP DOI BibTeX RDF
13	Hovhannes Tananyan	Domination games played on line graphs of complete multipartite graphs.	CoRR	2014	DBLP BibTeX RDF
13	Martin Milanic, Andrea Oversberg, Oliver Schaudt	A characterization of line graphs that are squares of graphs.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
13	Gurusamy Rengasamy Vijayakumar	Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues ≥ -2.	Discuss. Math. Graph Theory	2013	DBLP DOI BibTeX RDF
13	Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy	Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.	ISAAC	2013	DBLP DOI BibTeX RDF
13	Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano	Graph Equation for Line Graphs and m-Step Graphs.	Graphs Comb.	2012	DBLP DOI BibTeX RDF
13	Yiming Zhang, Ling Liu 0001	Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs.	IEEE Trans. Knowl. Data Eng.	2012	DBLP DOI BibTeX RDF
13	Abbas Heydari, Bijan Taeri	An operation based on complete graphs with an application to the line graphs of trees.	Ars Comb.	2012	DBLP BibTeX RDF
13	Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo	Collapsible graphs and Hamiltonian connectedness of line graphs.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
13	Weigen Yan, Yeong-Nan Yeh, Fuji Zhang	The asymptotic behavior of some indices of iterated line graphs of regular graphs.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
13	Klas Markström	Even cycle decompositions of 4-regular graphs and line graphs.	Discret. Math.	2012	DBLP DOI BibTeX RDF