Name
Abstract | ||
|---|---|---|
We characterize the edge-signed graphs in which every ‘significant’ positive closed walk (or combination of walks) has even length, under seven different criteria for significance, and also those edge-signed graphs whose double covering graph is bipartite. If the property of even length is generalized to positivity in a second edge signing, the characterizations generalize as well. We also characterize the edge-signed graphs with the smallest nontrivial chromatic numbers. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0012-365X(96)00386-X | Discrete Mathematics |
Keywords | Field | DocType |
bipartite graph | Complete bipartite graph,Discrete mathematics,Combinatorics,Indifference graph,Forbidden graph characterization,Chordal graph,Cograph,Pathwidth,1-planar graph,Triangle-free graph,Mathematics | Journal |
Volume | Issue | ISSN |
179 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.46 | 6 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Zaslavsky | 1 | 297 | 56.67 |