Line-Polar Graphs: Characterization and Recognition

DOI10.1137/100789208zbMath1237.05162OpenAlexW1977862280MaRDI QIDQ3225119

Ross Churchley, Jing Huang

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100789208

zbMATH Keywords

structural characterizationmonopolar partitionline-polar graphlinear time recognition algorithmline-monopolar graphpolar partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (8)

Monopolar graphs: complexity of computing classical graph parameters ⋮ Recognizing line-polar bipartite graphs in time \(O(n)\) ⋮ List monopolar partitions of claw-free graphs ⋮ Complexity and algorithms for recognizing polar and monopolar graphs ⋮ On the Polarity and Monopolarity of Graphs ⋮ Minimal obstructions to \(( \infty , k )\)-polarity in cographs ⋮ Algorithms for unipolar and generalized split graphs ⋮ Solving partition problems with colour-bipartitions

This page was built for publication: Line-Polar Graphs: Characterization and Recognition