### On generalized outerplanarity of line graphs

Jiří Sedláček (1990)

Časopis pro pěstování matematiky

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Jiří Sedláček (1990)

Časopis pro pěstování matematiky

Similarity:

Ladislav Nebeský (1977)

Časopis pro pěstování matematiky

Similarity:

Josef Voldřich (1978)

Časopis pro pěstování matematiky

Similarity:

Liebers, Annegret (2001)

Journal of Graph Algorithms and Applications

Similarity:

Xin Zhang, Guizhen Liu (2013)

Open Mathematics

Similarity:

If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity...

Daniel C. Slilaty, Thomas Zaslavsky (2015)

Discussiones Mathematicae Graph Theory

Similarity:

The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with the naturally induced vertex signature, are consistent. Their proof applies Hoede’s relatively difficult characterization of consistent vertex-signed graphs. We give a simple proof that does...

Jiří Sedláček (1989)

Časopis pro pěstování matematiky

Similarity: