New results and open problems in line graphs

DOI10.1080/09728600.2022.2093146MaRDI QIDQ6101461zbMATH OpenOpenAlexFDO

Authors Jay Bagga, L. W. Beineke

Publication date 1 June 2023

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/09728600.2022.2093146

zbMATH Keywords

line graphline completion numbersuper line graphline graph recognition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Line graphs and line digraphs
• scientific article; zbMATH DE number 1161249
• Old and new generalizations of line graphs
• Path graphs versus line graphs-\(A\) survey
• scientific article; zbMATH DE number 861395

Cites work

• scientific article; zbMATH DE number 4214062 (Why is no real title available?)
• scientific article; zbMATH DE number 1334630 (Why is no real title available?)
• scientific article; zbMATH DE number 861355 (Why is no real title available?)
• scientific article; zbMATH DE number 861395 (Why is no real title available?)
• scientific article; zbMATH DE number 861439 (Why is no real title available?)
• scientific article; zbMATH DE number 2188408 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• A labeling algorithm to recognize a line digraph and output its root graph
• A number theoretic problem on super line graphs
• A survey of line digraphs and generalizations
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• An efficient reconstruction of a graph from its line graph in parallel
• Characterizations of derived graphs
• Generalized line graphs
• ILIGRA: an efficient inverse line graph algorithm
• Incidence and strong edge colorings of graphs
• Isomorphisms and traversability of directed path graphs
• Line graphs and line digraphs
• Old and new generalizations of line graphs
• On the characterization of path graphs
• On the hardness of recognizing triangular line graphs
• Path graphs
• Reconstructing a graph from its arc incidence graph
• Some properties of line digraphs
• The interchange graph of a finite graph
• The super line graph \({\mathfrak L}_2\)

Cited in

(7)

• Non-existence of forbidden subgraph characterization of $H$-line graphs
• Old and new generalizations of line graphs
• Line graphs and line digraphs
• Realizability problem of distance-edge-monitoring numbers
• Triangular line graphs and word sense disambiguation
• scientific article; zbMATH DE number 1062960 (Why is no real title available?)
• Some news about oblique graphs

This page was built for publication: New results and open problems in line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101461)