FAQ

Line graph

Known as: Covering lattice, Derivative (graph theory), Theta-obrazom 
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1936-2017
05010019362016

Related topics

Related topics

49 relations
Biconnected componentBridge (graph theory)Caterpillar treeClaw-free graph
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Line graph
Diagram
Graph (discrete mathematics)
Graph theory
Medial graph
Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
On the metric dimension of the total graph of a graph
A resolving set of a graph G is a set S ⊆ V (G), such that, every pair of distinct vertices of G is resolved by some vertex in S… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Interval-valued fuzzy line graphs
In this paper, we introduce the concept of interval-valued fuzzy line graphs and discuss some of their properties. We prove a… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The structure of claw-free graphs
A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. At first sight, there seem to be a great variety of… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A Model of the Perceptual and Conceptual Processes in Graph Comprehension
The article proposes that graph comprehension emerges from an integrated sequence of several types of processes: pattern… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
On a Closure Concept in Claw-Free Graphs
If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line… (More)
Is this relevant?
1997
1997
Parallel and On-Line Graph Coloring
We discover a surprising connection between graph coloring in two orthogonal paradigms: parallel and on-line computing. We… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Coloring inductive graphs on-line
In this paper we consider the problem of on-line graph coloring. In an instance of on-line graph coloring, the nodes are… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
Given a graph <italic>H</italic> with <italic>E</italic> edges and <italic>N</italic> nodes, a graph <italic>G</italic> is sought… (More)
  • figure 1
Is this relevant?