Opening book details…
Can I read Supereulerian Complementary Graphs on EtoBox?
Supereulerian Complementary Graphs by Hong-Jian Lai is a Computer Science article available to read on EtoBox.
What is Supereulerian Complementary Graphs about?
## Abstract Nebeský in [12] show that for any simple graph with __n__ ≥ 5 vertices, either __G__ or __G^c^__ contains an eulerian subgraph with order at least __n__ ‐ 1, with an explicitly described class of exceptional graphs. In this note, we show that if __G__ is a simple graph with __n__ ≥ 61 vertices, then either __G__ or __G^c^__ is supereulerian, with some exceptions. We also characterize all these exceptional cases. These results are applied to show that if __G__ is a simple graph with __n__ ≥ 61 vertices such that both __G__ and __G^c^__ are connected, then either __G__ or __G^c^__ has a 4‐flow, or both __G__ and __G^c^__ have cut‐edges. © 1993 John Wiley & Sons, Inc.
Who reads Supereulerian Complementary Graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Hong-Jian Lai
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 1993
- Language
- EN
- Field
- Computer Science (Physical Sciences)