Graphoidal bipartite graphs

DOI10.1007/BF02986680zbMath0813.05056OpenAlexW2028032378MaRDI QIDQ1343223

S. Arumugam, C. Pakkiam

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986680

zbMATH Keywords

pathsbipartite graphintersection graphline graphtreessubdivision graphgraphoidal covergraphoidal bipartite graphsgraphoidal graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (8)

SIMPLE GRAPHOIDAL COVER ON TENSOR PRODUCT OF GRAPHS ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II ⋮ On graphoidal graphs ⋮ Truly non-trivial graphoidal graphs ⋮ The distinguishing number and the distinguishing index of line and graphoidal graph(s) ⋮ Graphoidal graphs and graphoidal digraphs: a generalization of line graphs ⋮ On graphoidal length of a tree in terms of its diameter ⋮ Graphoidally independent infinite graphs

Cites Work

• Graphoidal covers and graphoidal covering number of a graph
• On the graphoidal covering number of a graph
• On graphoidal graphs of a tree
• The Two-Triangle Case of the Acquaintance Graph

This page was built for publication: Graphoidal bipartite graphs