z-logo
Premium
A note on bipartite subgraphs of triangle‐free regular graphs
Author(s) -
Locke S. C.
Publication year - 1990
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190140206
Subject(s) - mathematics , combinatorics , bipartite graph , complete bipartite graph , triangle free graph , induced subgraph , discrete mathematics , graph , cograph , line graph , 1 planar graph , vertex (graph theory)
Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free r ‐regular graph are presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here